Tag Archives: Dijkstra

Printing Paths in Dijkstra’s Shortest Path Algorithm

Given a graph and a source vertex in graph, find shortest paths from source to all vertices in the given graph. We have discussed Dijkstra’s Shortest Path algorithm in below posts. Dijkstra’s shortest path for adjacency matrix representation Dijkstra’s shortest path for adjacency list representation The implementations discussed above only find shortest distances, but do… Read More »