DEQ
Maximum flow
Max flow in network UNDER CONSTRUCTION
2026.Nov.19 14:05:51
Edges From, To, capacity.
Algorithm     Edmonds-Karp, Ford-Fulkerson, Dinic.
Show values Show graph coordinates.

Solves maximum flow in a given network by the selected algorithm.

The default problem runs in < 1 s.

Shows the graphical solution.

Keywords: maximum flow; algorithms.

Acknowledgement: Francisco R. Mendonça, MSc student, Computer Science and Engineering, IST, University of Lisbon, Lisbon, Portugal.

Image
References: Plate: Sum2uniforms

• CISTI'2027, 16–19 June 2027, Porto (Portugal).

• 1701-11-11: Celsius, Anders (†1744-04-25, 42 yrs.).

 
 
Valid HTML 5! IST http://web.tecnico.ulisboa.pt/ist11038/compute/CISTI_2027/maxflow/P.maxflow.php
Created: 2026-11-11 — Last modified: 2026-11-16