dinic-algorithm

Here are 2 public repositories matching this topic...

Academical implementation of Edmonds-Karp algorithm in O(nm²) and Dinitz (Dinic) algorithm O(n²m) for computing the maximum flow of a flow network.

An efficient C++ implementation of various sequential and parallel maximum flow algorithms.

Add a description, image, and links to the dinic-algorithm topic page so that developers can more easily learn about it.

To associate your repository with the dinic-algorithm topic, visit your repo's landing page and select "manage topics."