Maximum Flow: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    10 October 2022

    • curprev 10:5910:59, 10 October 2022‎ Admin talk contribs‎ 2,538 bytes +2,538‎ Created page with "== Problem Description== In optimization theory, maximum flow problems involve finding a feasible flow through a flow network that obtains the maximum possible flow rate. The maximum flow problem can be seen as a special case of more complex network flow problems, such as the circulation problem. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Maximum_Flow"