|
|
|
| AN ALGORITHM FOR FINDING THE SHORTEST PATH IN DOUBLE-LOOP NETWORKS |
| Liu Huanping①; Zhu Yangong②; Yang Yixian① |
| ①Dept. of Information Eng.,Beijing University of Posts and Telecom., Beijing 100876;②Harbin Institute of Technology Haerbin 150006 |
|
|
|
|
Abstract Double-loop network has been one of the most populular topologies used in the distribution systwms. An important problem is to find the shortest path between any two nodes in this kind of networks. This paper gives an O(△) time algorithm for finding the shortest path between any two nodes of the double-loop network.
|
|
Received: 05 September 1997
|
|
|
|
|
|
|
|
|
1999, Vol. 21 
