Dijkstra’s algorithm

Unknown

Just like Prim’s Algorithm, the MST is also the shortest path.
It is also a greedy algorithm.

Same as prim’s algorithm: Prim’s Algorithm
Dijkstra’s algorithm takes $O(V^{2})$ time, with the time dominated by the time spent in priority queue.

• Bellman-Ford algorithm, also a shortest path algorithm.