Technical Note—On Hu's Decomposition Algorithm for Shortest Paths in a Network

Abstract

Hu and Torres have proposed a decomposition algorithm for finding the shortest paths between all pairs of nodes in a sparse network in which subnetworks are linearly overlapped. The purpose of this note is to point out how the efficiency of this algorithm can be improved by making a modification.