Vidyalelo
Data Structure · Q140

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 140

Q140

In the given graph, identify the path that has minimum cost to travel from node a to node f.

In the given graph, identify the path that has minimum cost to travel from node a to node f.
Graph Algorithms (DFS, BFS, Dijkstras, etc) mcq question image
A.
a-b-c-f
B.
a-d-e-f
C.
a-d-b-c-f
D.
a-d-b-c-e-f
Answer

Answer: Option D

Solution

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