Bipartite minimum vertex cover
Given a bipartite graph with nL left nodes (0..nL-1), nR right nodes (0..nR-1), and a list of edges [l, r], return the size of the minimum vertex cover: the fewest vertices (from either side) that touch every edge. Use Konig's theorem (in a bipartite graph the minimum vertex cover size equals the maximum matching size). Assume 1 <= nL, nR <= 500.
Implement
min_vertex_cover_bipartite(nL: int, nR: int, edges: list[list[int]]) → intExamples
in
[2,2,[[0,0],[0,1],[1,1]]]out2What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 30 min
solution.py
InputExpectedGot
[2,2,[[0,0],[0,1],[1,1]]]2not run yetsample