https://github.com/sleekpanther/bipartite-matching
Application of Ford-Fulkerson algorithm to find the maximum matching between 2 sides of a bipartite graph
https://github.com/sleekpanther/bipartite-matching
algorithm bipartite-graphs bipartite-network capacity cardinality directed-edges directed-graphs flow-network flow-networks ford-fulkerson graph match maxflow maximum-matching
Last synced: about 1 month ago
JSON representation
Application of Ford-Fulkerson algorithm to find the maximum matching between 2 sides of a bipartite graph
- Host: GitHub
- URL: https://github.com/sleekpanther/bipartite-matching
- Owner: SleekPanther
- Created: 2017-04-15T14:00:04.000Z (about 8 years ago)
- Default Branch: master
- Last Pushed: 2017-04-21T11:14:57.000Z (about 8 years ago)
- Last Synced: 2025-03-26T10:21:18.831Z (2 months ago)
- Topics: algorithm, bipartite-graphs, bipartite-network, capacity, cardinality, directed-edges, directed-graphs, flow-network, flow-networks, ford-fulkerson, graph, match, maxflow, maximum-matching
- Language: Java
- Homepage:
- Size: 787 KB
- Stars: 12
- Watchers: 1
- Forks: 4
- Open Issues: 0