By using a max-flow algorithm bipartite matching problem is solved in this project. Optimal mathing is done by using the Dinic's Algorithm.
-
Notifications
You must be signed in to change notification settings - Fork 0
furknbulbul/Matching-Maximum-Flow
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published