Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 20
How can bipartite matching be solved?
A
With topological sort
B
With binary search only
C
As max flow with unit capacities, or with Hopcroft-Karp in O(E √V)
D
With Dijkstra