|
|
Implementation of Ford-Fulkerson Algorithm
Makovský, Benjamin ; Rychnovský, Lukáš (referee) ; Masopust, Tomáš (advisor)
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.
|
|
|
Implementation of Ford-Fulkerson Algorithm
Makovský, Benjamin ; Rychnovský, Lukáš (referee) ; Masopust, Tomáš (advisor)
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.
|
|
|
Optimalization of flows in the network using the linear programming
Doubrava, Jiří ; Kalčevová, Jana (advisor) ; Flusserová, Lenka (referee)
This thesis deals with optimization of flows in a network with focus on solutions based on linear programming. The theoretical part is divided into three main sections: maximal flow, minimal flow and maximal flow with minimal costs. The first part focuses on theoretical basics of maximal flow problem and mainly on these algorithms: Ford-Fulkerson, Dinic/Edmonds-Karp, Three Indians algorithm and Goldberg push-relabel algorithm. These are explained on examples. The other chapters explain the minimal flow and the maximal flow with minimal costs problems with simple algorithms for their solutions, again explained on some examples. The practical part includes software solution of maximal flow problem in application MaxTok, which can be found on attached CD.
|
|
|
The Theory of Graphs and the Solution of Its Exercises in the System LINGO
Drechslerová, Tereza ; Jablonský, Josef (advisor) ; Zouhar, Jan (referee)
The aim of this bachelor thesis is to introduce basic types of exercises of theory of graphs and to display possible methods of their solution. I have chosen these types of exercises: finding minimal skeleton, finding maximum river and Critical Path Method (CPM) and I specify them. Praticular exercises are solved in the system LINGO and after that by specific algorithm for optimalization in the graph. Part of my work also presents explanation of basic terms and short historical review of developement of the theory of graphs.
|
|
|
The maximum flow in a network
Tichá, Michaela ; Pelikán, Jan (advisor) ; Čížek, Ondřej (referee)
The work describes how to find the maximum flow in a network. It has two parts - theoretic and programmatic. The theoretic part desribes founded maximum flow algorithms. The programmatic part contains program for searching the maximum flow in a network.
|
guest ::
