| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Program za vizualizacijo postopka iskanja maksimalnega pretoka v mrežah tokov : diplomsko delo
Authors:ID Šuc, Kevin (Author)
ID Strnad, Damjan (Mentor) More about this mentor... New window
ID Kohek, Štefan (Comentor)
Files:.pdf UN_Suc_Kevin_2019.pdf (2,22 MB)
MD5: 973CB493B283DE990ECAF7BD6AB5DD82
PID: 20.500.12556/dkum/52107630-5b60-4a98-b2fd-45f656c78b37
 
Language:Slovenian
Work type:Bachelor thesis/paper
Typology:2.11 - Undergraduate Thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:Diplomsko delo zajema področje iskanja maksimalnega toka v mrežah tokov. Osrednji namen je implementacija grafične aplikacije, ki omogoča prikazovanje vmesnih korakov pri izvajanju Ford-Fulkersonove metode in algoritma potisni-povišaj. Aplikacijo smo implementirali v programskem jeziku C# z uporabo ogrodja Windows Forms in knjižnice Microsoft Automatic Graph Layout. Aplikacijo in oba algoritma za iskanje maksimalnega toka smo uspešno implementirali. Opravili smo primerjavo algoritmov in ugotovili, da algoritem potisni-povišaj, pri uporabljenih grafih, v povprečju izvede več vmesnih korakov kot Ford-Fulkersonova metoda. Posledično se dlje časa izvaja in ima tudi višjo povprečno porabo pomnilnika.
Keywords:maksimalni, pretok, vizualizacija, mreža, iskanje
Place of publishing:Maribor
Place of performance:Maribor
Publisher:[K. Šuc]
Year of publishing:2019
Number of pages:VII, 50 f.
PID:20.500.12556/DKUM-74757 New window
UDC:004.921(043.2)
COBISS.SI-ID:22873366 New window
NUK URN:URN:SI:UM:DK:S0CXZIYG
Publication date in DKUM:13.11.2019
Views:950
Downloads:87
Metadata:XML DC-XML DC-RDF
Categories:KTFMB - FERI
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Licences

License:CC BY-SA 4.0, Creative Commons Attribution-ShareAlike 4.0 International
Link:http://creativecommons.org/licenses/by-sa/4.0/
Description:This Creative Commons license is very similar to the regular Attribution license, but requires the release of all derivative works under this same license.
Licensing start date:05.09.2019

Secondary language

Language:English
Title:Program for visualizing the procedure of finding the maximum flow in flow networks
Abstract:The graduation thesis covers the field of algorithms for finding the maximum flow in flow networks. The main purpose of the thesis is to implement a graphical application that allows visualization of intermediate steps during the execution of the Ford-Fulkerson method and the push-relabel algorithm. The application was written in the C# programming language with the use of the Windows Forms framework and the Microsoft Automatic Graph Layout library. The application and both algorithms have been successfully implemented. We performed a comparison between the implemented algorithms and found out that, in our graphs, the push-relabel algorithm has a higher average count of intermediate steps in comparison to the Ford-Fulkerson method. Consequently, it also has a longer execution time and higher memory usage.
Keywords:maximum, flow, visualization, network, search


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica