Dijkstra’s Algorithm for Adjacency List Representation – Greedy Algorithm – We have discussed Dijkstra’s algorithm and its implementation for adjacency.In this post, O(ELogV) algorithm for adjacency list representation is discussed.
example of dijkstra algorithm for shortest path
2 Articles
2
Dijkstra’s shortest path algorithm – Greedy algorithm – Dijkstra’s algorithm is very similar to Prim’s algorithm for minimum spanning tree. Like Prim’s MST, we generate a SPT (shortest path tree) with given source as root.