prikaz prve stranice dokumenta Problem maksimalnog protoka
  Download
PDF 1.04 MB
master's thesis
Problem maksimalnog protoka
2023. urn:nbn:hr:166:412580
Piplica, Jelena
University of Split
Faculty of Science
Department of Mathematics

Cite this document

Piplica, J. (2023). Problem maksimalnog protoka (Master's thesis). Split: University of Split, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:166:412580

Piplica, Jelena. "Problem maksimalnog protoka." Master's thesis, University of Split, Faculty of Science, 2023. https://urn.nsk.hr/urn:nbn:hr:166:412580

Piplica, Jelena. "Problem maksimalnog protoka." Master's thesis, University of Split, Faculty of Science, 2023. https://urn.nsk.hr/urn:nbn:hr:166:412580

Piplica, J. (2023). 'Problem maksimalnog protoka', Master's thesis, University of Split, Faculty of Science, accessed 19 April 2024, https://urn.nsk.hr/urn:nbn:hr:166:412580

Piplica J. Problem maksimalnog protoka [Master's thesis]. Split: University of Split, Faculty of Science; 2023 [cited 2024 April 19] Available at: https://urn.nsk.hr/urn:nbn:hr:166:412580

J. Piplica, "Problem maksimalnog protoka", Master's thesis, University of Split, Faculty of Science, Split, 2023. Available at: https://urn.nsk.hr/urn:nbn:hr:166:412580

Please login to the repository to save this object to your list.
Metadata
TitleProblem maksimalnog protoka
Title (english)Maximum flow problem
AuthorJelena Piplica
MentorJurica Perić (mentor)
Committee memberJurica Perić (predsjednik povjerenstva)
Committee memberMilica Klaričić Bakula (član povjerenstva)
Committee memberAna Laštre (član povjerenstva)
GranterUniversity of Split
Faculty of Science
(Department of Mathematics)
Split
Defense date and country2023-07-14, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Abstract
Dijkstra algoritam i Bellman-Ford algoritam su algoritmi koji se koriste za pronalaženje najkraćeg puta u težinskom grafu. Dijkstra algoritam djeluje na pozitivnim težinama bridova i koristi se za pronalaženje najkraćeg puta od jednog početnog vrha do svih ostalih vrhova u grafu. Bellman-Ford algoritam, s druge strane, može se koristiti čak i kada postoje negativne težine bridova, ali ima složenost vremena veću od Dijkstra algoritma. Ford-Fulkerson algoritam koristi se za pronalaženje maksimalnog mrežnog protoka, a temelji se na uvećavajućim putevima. Ovaj algoritam iterativno pronalazi uvećavajuće puteve i uvećava protok dok ne postigne maksimalni protok. Ovi algoritmi su važan alat za rješavanje različitih problema u području grafova i optimizacije.
Abstract (english)
Dijkstra’s algorithm and Bellman-Ford algorithm are algorithms used to find the shortest path in a weighted graph. Dijkstra’s algorithm works with positive edge weights and is used to find the shortest path from a single source node to all other nodes in the graph. On the other hand, the Bellman-Ford algorithm can handle graphs with negative edge weights but has a higher time complexity compared to Dijkstra’s algorithm. The Ford-Fulkerson algorithm is used to find the maximum flow in a network and is based on augmenting paths. This algorithm iteratively finds augmenting paths and increases the flow until it reaches the maximum flow. All algorithms are important tools for solving various graph and optimization problems.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:166:412580
Study programmeTitle: Mathematics; specializations in: major in pure mathematics, major in computing, major in teaching, major in statistics and computing
Course: major in computing
Study programme type: university
Study level: graduate
Academic / professional title: magistar/magistra matematike (magistar/magistra matematike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence Attribution 4.0 International (CC BY 4.0) icon
Created on2023-07-14 11:44:25