##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Two groups where members can connect across groups. Find the maximum number of matched pairs.
(Pairing people and tasks)
(No shared endpoints)
(Largest possible set)
(Everyone gets paired)
Alternating matched and unm...
(One more edge each time)
(DFS from unmatched nodes)
Knowledge check
Greedy augmenting path search
(Try to match left node)
(CSES 1696)
(CSES link)
(Bipartite matching directly)
(DFS-based matching)
(C++ Kuhn's algorithm)
(3 boys 4 girls)
(Direct bipartite matching)
Knowledge check
(Flow network construction)
(Flow equals matching)
(Matching equals vertex cover)
(Construction from matching)
Condition for perfect matching
(Exponential subsets)
Knowledge check
(Workers and tasks)
(Time slots and tasks)
(General bipartite graph)
(Kuhn's algorithm directly)
(Python version)
(4 left 3 right)
(Recursive rematching)
(Greedy vs matching)
(Two pointers)
(Bipartite matching approach)
(Greedy two pointers)
(When to use matching)
Knowledge check
(Maximum weight matching)
(Nodes arrive over time)
Matching impl errors
(Stop when matching is full)
(Faster maximum matching)
Kuhn vs Max Flow vs Hopcrof...
(König's theorem application)
(Cover with edges)
(Complement of vertex cover)
Knowledge check
(When to use)
(Maximum matching algorithms)