A hierarchical Algorithm to Solve the Shortest Path Problem in Valued Graphs

Michel Koskas

This paper details a new algorithm to solve the shortest path problem in valued graphs. Its complexity is $O(D\log v)$ where $D$ is the graph diameter and $v$ its number of vertic…