So all shortest paths must be of length at most k. <BR><BR>One solution, which works well for small k, is to run the Bellman-Ford algorithm (slightly modified) for k steps. This takes O (km) time.

In this note we present some computational evidence to suggest that a version of Bellman's shortest-path algorithm outperforms Treesort-Dijkstra's for a certain class of networks. OR professionals in ...