The algorithm of matrix table operation of solving a shorte st path problem
Xia Xinnian · 2000
On the progressive formation of a tree,the algorithm of solv ing a shortest path problem is raised in which a matrix computation is imit ated. The computation is accomplished on a matrix table,completely. In one time operational procedure, the shortest path and distance values are all obtained w hich other jointpoints are relative to the startpoint on a network c hart. The details of this algorithm is introduced by a example.