Ford-Fulkerson

From Progteam

(Difference between revisions)
Jump to: navigation, search
(New page: foo)
Line 1: Line 1:
-
foo
+
The '''Ford Fulkerson Algorithm''' is a procedure for solving the [[Max Flow]] (and therefore, also the min-cut) problem.

Revision as of 22:49, 19 October 2008

The Ford Fulkerson Algorithm is a procedure for solving the Max Flow (and therefore, also the min-cut) problem.

Personal tools