Siyetian Dynamic IPAd spaceSiyetian Static IPAd spaceZhongyi Fingerprint BrowserAd space
Learning and Calculation

Network Maximum Flow and Minimum Cut

Calculate maximum flow from a specified source to a sink and a corresponding minimum cut using directed edge capacities.

Network Maximum Flow and Minimum Cut User manual

  1. Fill in the parameters or select the file according to the form, and check the unit and format first.
  2. The source point passes through two independent channels with capacity 3 and 2 respectively, and the maximum flow rate is 5.
  3. Click the processing button to view the results, you can copy or download and save.

Calculation method and processing rules

Use Edmonds-Karp augmenting paths in a residual network to report edge flows, capacities and both sides of a minimum cut.

scope of use

Up to 80 nodes and 500 edges, the capacity is 0 to 1000000000 integers; it is not the actual network speed detection, and does not include cost, loss and multi-source constraints.

Will the input content be saved on the server?

This tool handles input in the browser, and does not upload files or form content. Typing practice scores are only saved in the native browser.

Why may the result be different from other tools?

Up to 80 nodes and 500 edges, the capacity is 0 to 1000000000 integers; it is not the actual network speed detection, and does not include cost, loss and multi-source constraints. Please compare the input unit, rounding method, applicable rules and data version first.