Menu
Given a graph and a destination node, how do you find all the shortest paths from all other vertices to the destination vertex.
592
Approach: The is to do a Breadth First Traversal (BFS) for a graph. Below are the steps: Start BFS traversal from source vertex. While doing BFS, store the shortest distance to each of the other nodes and also maintain a parent vector for each of the nodes.
The Dijkstra Shortest Path algorithm computes the shortest path between nodes. The algorithm supports weighted graphs with positive relationship weights. The Dijkstra Single-Source algorithm computes the shortest paths between a source node and all nodes reachable from that node.
Dijkstra's algorithm. You can work it backwards as if your destination is your starting vertex. This will give you the distance and path to any other node.
*PS: Just one thing to remember. You need to reverse the edges BEFORE applying Dijkstra with your destination as your starting vertex in order for that to work.
192
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
