Vidyalelo
Data Structure · Q86

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 86

Q86

In the given graph, identify the shortest path having minimum cost to reach vertex E if A is the source vertex.

In the given graph, identify the shortest path having minimum cost to reach vertex E if A is the source vertex.
Graph Algorithms (DFS, BFS, Dijkstras, etc) mcq question image
A.
a-b-e
B.
a-c-e
Answer
C.
a-c-d-e
D.
a-c-d-b-e

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board