Implementation of Ford-Fulkerson Algorithm

This work describes the design of the graphic implementation of the Ford-Fulkerson Algorithm for searching the maximum flow and the minimal cut in the network. It contains a brief introduction with the theory of the graphs and the flows in the networks, it describes the principle of the Ford-Fulkerson Algorithm. The object design representing the graph in the program is cited, the drawing of the graph by the program and the creation of the graphic user interface of the application is described. The final program is worked up as a Java applet which is placed at the public internet pages www.ffaplikace.php5.cz