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. |