This lesson is for subscribers
You've completed the free preview. Subscribe to unlock every lesson in every course.
Learn the Hungarian algorithm to find maximum matchings in bipartite graphs by repeatedly finding augmenting paths.
You've completed the free preview. Subscribe to unlock every lesson in every course.