Question

Exercise # 2: Modify getShortestPath (graph, from, to) function so that if there is more than one minimum path from source node to destination node, it gives you the one with the minimum number of edges. Example 1: Input Graph: Adjacency list of the following graph. 7 A B 6 2 3 2 E D C From: A To: For B Output 9 8 2 F G 4 [(A, F)] That is, the distance from A to F is 10 both through the following path A?D?F, A?D?C?G?F the correct answer is A?D?F [(A, B)] That is, the distance from A to B is 7 both through the following paths A?B, A?D?C?B the correct answer is A?B

          Exercise # 2: Modify getShortestPath (graph, from, to) function so that if there is more than
one minimum path from source node to destination node, it gives you the one with the minimum
number of edges.
Example 1:
Input
Graph: Adjacency list of the following graph.
7
A
B
6
2
3
2
E
D
C
From: A
To: For B
Output
9
8
2
F
G
4
[(A, F)]
That is, the distance from A to F is 10 both through the following path
A?D?F,
A?D?C?G?F
the correct answer is A?D?F
[(A, B)]
That is, the distance from A to B is 7 both through the following paths
A?B,
A?D?C?B
the correct answer is A?B

Exercise # 2: Modify getShortestPath (graph, from, to) function so that if there is more than
one minimum path from source node to destination node, it gives you the one with the minimum
number of edges.
Example 1:
Input
Graph: Adjacency list of the following graph.
7
A
B
6
2
3
2
E
D
C
From: A
To: For B
Output
9
8
2
F
G
4
[(A, F)]
That is, the distance from A to F is 10 both through the following path
A?D?F,
A?D?C?G?F
the correct answer is A?D?F
[(A, B)]
That is, the distance from A to B is 7 both through the following paths
A?B,
A?D?C?B
the correct answer is A?B

Added by Timothy R.

Question

Please give Ace some feedback