Please enable JavaScript.
Coggle requires JavaScript to display documents.
Dijkstra’s algorithm - Coggle Diagram
Dijkstra’s algorithm
-
//Input: A weighted connected graph G = V,E with nonnegative weights
-
-
-
-
-
-
Insert(Q, v, dv) //initialize vertex priority in the priority queue
ds ← 0; Decrease(Q, s, ds) //update priority of s with ds
-
-
-
-
-
-
du ← du∗ + w(u∗, u); pu ← u∗
-
-
-
-
-
-
Dijkstra’s algorithm finds the shortest paths to a graph’s vertices in order of
their distance from a given source.
