Vidyalelo
Data Structure · Q110

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 110

Q110

Consider the following graph. What is the minimum cost to travel from node A to node C?

Consider the following graph. What is the minimum cost to travel from node A to node C?
Graph Algorithms (DFS, BFS, Dijkstras, etc) mcq question image
A.
5
B.
2
Answer
C.
1
D.
3

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board
PreviousNext
All Graph Algorithms (DFS, BFS, Dijkstras, etc) questions