Dijkstra's Shortest Path

graphs

Best O((V + E) log V)Avg O((V + E) log V)Worst O((V + E) log V)Space O(V)

Preparing Dijkstra's Shortest Path...

Finds single-source shortest paths on weighted non-negative graphs using a priority queue greedy strategy.