Home > Search Results: keywords:"maximum flow"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 3 records found  Search took 0.01 seconds. 
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.
Detailed record
Measurement of Water Consumption on the Supply of the WC Boarding School Building
 Moštěk, Jan
The paper provides findings from research on flow measurements in the premises of the boarding school in Brno at all measurement days. The first part of the contribution describes the measurement of flows in the premises of the boarding house. The measurement was carried out in 2019 and the task was to determine the profitability of the use of rainwater for the distribution of working water for the supply of WC. In the second part of the contribution, an evaluation of the measured data on a day-by-day basis from the measured object is made. The third part of the article will discuss the evaluation results and the conclusion of the contribution is a summary by the author.
Detailed record
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.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English