Djkstra's – Shortest Path Algorithm | 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. We will discuss different ways to implement Djkstra's – Shortest Path Algorithm.
Post to Tumblr