Max-Flow Problem: Ford-Fulkerson Algorithm

Maximum Flow Problem: Ford-Fulkerson Algorithm

Given a connected graph G=(V,E), a weight c:E->R+, and two nodes s and t, find a maximum s-t flow. Here is a JAVA applet illustrating the Ford-Fulkerson Labeling Algorithm, which yields a max-flow and a min-cut.
SEE ALSO
Last Modified: Thu Jan 29 15:49:05 JST 1998
Mail to: ikeda@is.tokushima-u.ac.jp