476.txt

来自「This complete matlab for neural network」· 文本 代码 · 共 22 行

发信人: fervvac (高远), 信区: DataMining
标  题: Re: matrix calculation
发信站: 南京大学小百合站 (Thu Oct 24 20:28:05 2002), 站内信件

Then it is the all shortest path problem? If so, just use dijkstra algorithm
and it can be coputed in O(|v|^3) time. (possible improvements exist).

【 在 helloboy (hello) 的大作中提到: 】
: min means the corresponding matrix cell's count 
: 【 在 fervvac (高远) 的大作中提到: 】
: : What does your min() means?
: : According to your definition, it seems A^n contains values x at cell(i,j)
: : s.t., x is the shortest path from i to j via (n-1) node. Therefore, if
: : ytour min() is to take min() among all corresponding cells in the matrix
: : array, then it should be the shortest distance between i, and j and that is
: : a classic problem.
: : (以下引言省略 ... ...)


--
※ 来源:．南京大学小百合站 bbs.nju.edu.cn．[FROM: 143.89.41.4]