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.