Please enable JavaScript.
Coggle requires JavaScript to display documents.
DIJKSTRA'S ALGORITHM - Coggle Diagram
DIJKSTRA'S ALGORITHM
-
-
-
It creates a tree of shortest paths from the starting vertex, the source, to all other points in the graph
-
-
-
Q, a queue of all nodes in the graph. At the end of the algorithm's progress, Q will be empty.
S, an empty set, to indicate which nodes the algorithm has visited. At the end of the algorithm's run, SS will contain all the nodes of the graph.