-
Updated
Aug 4, 2020 - Python
#
augmenting-path
Here are 4 public repositories matching this topic...
AGT course project on maximum matching in bipartite and general graphs
blossom hungarian-algorithm hopcroft-karp bipartite maximum-matching kuhn-munkres blossom-algorithm augmenting-path jack-edmonds augmenting
-
Updated
Dec 25, 2020 - TeX
Graph-based seminar topic allocation using maximum bipartite matching, with minimum vertex cover for bottleneck analysis and explanation of unmet assignments.
cpp imgui max-flow hopcroft-karp maximum-matching minimum-vertex-cover augmenting-path bipartite-matching
-
Updated
Apr 19, 2026 - C++
This project solves the maxflow problem in algorithmics from an instance in the instances directory, The problem is solved using GLPK and the augmenting path DInitz algorithm
glpk maximum-flow maximum-flow-solver lp-solver augmenting-path maximum-flow-algorithm maximum-flow-problem dinitz
-
Updated
May 22, 2023 - Python
Improve this page
Add a description, image, and links to the augmenting-path topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the augmenting-path topic, visit your repo's landing page and select "manage topics."