Vidyalelo
Data Structure · Q101

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 101

Q101

Consider the following graph. If b is the source vertex, what is the minimum cost to reach f vertex?

Consider the following graph.
Graph Algorithms (DFS, BFS, Dijkstras, etc) mcq question image
If b is the source vertex, what is the minimum cost to reach f vertex?
A.
8
B.
9
C.
4
D.
6
Answer

Answer: Option D

Solution

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