A Note on Finding All Shortest Paths

We present a procedure for finding the shortest routes between all pathconnected ordered pairs of nodes in a network. Furthermore, our approach is quite simple and highly efficient for a special class of network problems. In particular, this class of networks subsumes a number that appear in real world applications. For instance, the Polish government and the Texas Water Resources Developmental Board have developed water resource analysis models that are in this class.