Dijkstra's

From VT.Prog

Dijkstra's algorithm is a solution for a single-source shortest path problem in which all paths have non-negative weights. It is somewhat similar to Prim's algorithm.

Clearly, this article is a stub. If it were not, you would find a description of the actual algorithm in this general area.

Dijkstra's algorithm has a time complexity of O(E lg V), where E = edges in the graph and V = vertices. The space complexity is O(V).