A Note on Finding All Shortest Paths
TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES
Pagination or Media Count:
The authors present a procedure for finding the shortest route between all pairs of nodes in a network. The approach is quite simple, but is highly efficient for a special class of network problems. In particular, this class of networks subsumes a number of networks which appear in real world application. For instance, the Polish government has developed a network model for water resource analysis which is in this class of networks.
- Operations Research