Q29
Which traversal method is best for finding connected components in an undirected graph?
A.
Breadth-First Search (BFS)
B.
Dijkstra's Algorithm
C.
Bellman-Ford Algorithm
D.
Depth-First Search (DFS)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board