Q163
In the given graph, how many intermediate vertices are required to travel from node a to node e at a minimum cost?
In the given graph, how many intermediate vertices are required to travel from node a to node e at a minimum cost?
A.
2
B.
0
C.
1
AnswerD.
3
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board