The problem of finding all minimum-hop paths from one node to another arises in several contexts for adaptive routing in computer communication networks. This paper presents an efficient algorithm for determining all paths with minimum number of links between two nodes in a network. Polynomial bound is established for the worst case time complexity of the algorithm. Directions for further research are also proposed.