Q41
Which graph traversal method can be used to check if a graph is bipartite?
A.
Kruskal's Algorithm
B.
Dijkstra's Algorithm
C.
Depth-First Search (DFS)
D.
Breadth-First Search (BFS)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board