Dijkstra's – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap – Java Implementation | Algorithms
Dijkstra algorithm is a greedy algorithm. It finds a shortest path tree for a weighted undirected graph. the algorithm finds the shortest path between source node and every other node. In this article we will implement Djkstra's – Shortest Path Algorithm (SPT) using Adjacency List and Min Heap.
Post to Tumblr