Practice
Learn
← Quit
0 / 0 correct
Algorithms
Medium
1 of 20
How do you check whether a graph is bipartite?
A
Run Dijkstra
B
Try to 2-color it with BFS/DFS; a conflict (adjacent nodes with the same color) means it isn't
C
Check if it has an even number of nodes
D
Check if it's a tree