Dinic's blocking flow algorithm solving maximum network flow and minimum s-t cut in O(V^2 E) with level graphs and pointer optimizations.
-
Updated
Sep 9, 2026 - Python
#
dinics-algorithm
Here are 3 public repositories matching this topic...
Dinic's blocking flow algorithm solving maximum network flow and minimum s-t cut in O(V^2 E) with level graphs and pointer optimizations.
-
Updated
Sep 9, 2026 - Python
python computer-science education algorithms network-flow pathfinding data-structures graph-theory dijkstra interactive-visualization floyd-warshall hungarian-algorithm max-flow hopcroft-karp minimum-spanning-tree bellman-ford bipartite-matching streamlit dinics-algorithm johnsons-algorithm
-
Updated
Mar 10, 2026 - Python
Add this topic to your repo
To associate your repository with the dinics-algorithm topic, visit your repo's landing page and select "manage topics."