Given a graph, find the shortest path between the given source and destination nodes.
1 -> 0 -> 4 -> 5
1 -> 0 -> 2 -> 5
1 -> 2 -> 5
Shortest path: 1 -> 2 -> 5
Number of edges: 2
@@coding::1@@
Recommended Programs