Vidyalelo
Data Structure · Q90

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 90

Q90

Consider the following graph. Using Kruskal's algorithm, which edge will be selected first?

Consider the following graph. Using Kruskal's algorithm, which edge will be selected first?
Graph Algorithms (DFS, BFS, Dijkstras, etc) mcq question image
A.
GF
B.
DE
C.
BE
Answer
D.
BG

Answer: Option C

Solution

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