School project solving the problem of finding the maximum matching in a given bipartite graph. This is a solution using the Ford-Fulkerson algoritm and reducing the problem to an instance of the maximum-flow problem.
-
Notifications
You must be signed in to change notification settings - Fork 0
JimmyLindstrom/MaxFlow
About
School project
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published