The Maximum Flow Algorithms Applet is meant to illustrate the Ford and Fulkerson max flow algorithm in Java, a quasi-multi-platform language. It is based on Professor O. Goldschmidt's GRaph ALgorithms (GRAAL) software package. The applet is a tool for manipulating graphs and for solving the maximum flow problem.

At this time, an on-line user manual has not been made. Simply, a graph is a collection of nodes and edges which connect the nodes. Edges can be from a node "1" to a node "2" and vice versa. Each edge and node has special properties which can be manually edited or manipulated by the various algorithms available. The maximum number of nodes is 1000 and the maximum number of edges is a complete graph (Kn) with 1000 nodes.

Each node has a unique loccation in a 10,000x10,000 grid. When starting
the applet, the grid is mapped onto the applet window. Try to move the
mouse in the window and see the corresponding position in the grid displayed
in the lower right corner of the applet.

Back to the Graph Algorithms Applet