Ford-Fulkerson

From Progteam

Revision as of 22:49, 19 October 2008 by Hjfreyer (Talk | contribs)
Jump to: navigation, search

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

Personal tools