| Article ID: | iaor20022991 |
| Country: | China |
| Volume: | 14 |
| Issue: | 1 |
| Start Page Number: | 48 |
| End Page Number: | 50 |
| Publication Date: | Mar 2001 |
| Journal: | Basic Sciences Journal of Textile Universities |
| Authors: | Ren Pingan, Li Wenli |
A new algorithm which finds the shortest path between every two nodal points in undirected network is given in this paper. The algorithm not only has convenient function that records path mark, but also reduces computation.