Thesis Details

Implementace Ford-Fulkersonova algoritmu

Bachelor's Thesis Student: Makovský Benjamin Academic Year: 2006/2007 Supervisor: Masopust Tomáš, RNDr., Ph.D.
English title
Implementation of Ford-Fulkerson Algorithm
Language
Czech
Abstract

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.

Keywords

Graph, node, edge, network, maximum flow, minimum cut, Ford-Fulkerson Algorithm, Java applet.

Department
Degree Programme
Information Technology
Files
Status
defended, grade A
Date
11 June 2007
Reviewer
Committee
Černocký Jan, prof. Dr. Ing. (DCGM FIT BUT), předseda
Křena Bohuslav, Ing., Ph.D. (DITS FIT BUT), člen
Kunovský Jiří, doc. Ing., CSc. (DITS FIT BUT), člen
Lukáš Roman, Ing., Ph.D. (DIFS FIT BUT), člen
Martinek David, Ing. (DIFS FIT BUT), člen
Sojka Petr, doc. RNDr., Ph.D. (FI MUNI), člen
Citation
MAKOVSKÝ, Benjamin. Implementace Ford-Fulkersonova algoritmu. Brno, 2007. Bachelor's Thesis. Brno University of Technology, Faculty of Information Technology. 2007-06-11. Supervised by Masopust Tomáš. Available from: https://www.fit.vut.cz/study/thesis/3897/
BibTeX
@bachelorsthesis{FITBT3897,
    author = "Benjamin Makovsk\'{y}",
    type = "Bachelor's thesis",
    title = "Implementace Ford-Fulkersonova algoritmu",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2007,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/3897/"
}
Back to top