Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Maxflödesalgoritmer i Java: En studie av vikten att välja rätt algoritm och datastruktur för att minimera körtiden för exakta maxflödesalgoritmer
KTH, School of Computer Science and Communication (CSC).
KTH, School of Computer Science and Communication (CSC).
2015 (Swedish)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [sv]

Maxflödesproblemet har många praktiska tillämpningar och probleminstanserna kan bli mycket stora. Effektiva implementationer är därför nödvändigt för att körtiden inte ska bli alltför hög. I den här studien har två maxflödesalgoritmer, Edmonds-Karps algoritm och Goldberg-Tarjans push-relabel-algoritm, implementerats i Java med två olika da- tastrukturer och jämförts med varandra. Det framkommer att det är fördelaktigt att implementera en mer komplex, objektbaserad, grafre- presentation för grafinstanser som ligger under en kritisk gräns i antal kanter. När antalet kanter överstiger den kritiska gränsen blir en enkla- re, men mer minneskrävande, implementation med grannlista av heltal tillsammans med matriser effektivare. Tyvärr saknas tillräcklig data för att kunna dra slutsatser om huruvida Edmonds-Karps algoritm eller Goldberg-Tarjans push-relabel-algoritm är att föredra vid implementa- tion i Java. 

Abstract [en]

The maximum flow problem has many real world applications and the problem instances can get very large. Efficient implementations are therefore important to limit execution time. In this report, two maximum flow algorithms, Edmonds-Karps algorithm and Goldberg-Tarjans push-relabel algoritm, has been implemented in Java, each with two different data structures. The efficiancy of the datastructures and algorithms was evaluated. It was found that a more complex, object based, graph representation is preferable for graph instances that have fewer than a critical number of edges. When the number of edges exceeds the critical limit the simpler, but more memory intensive, graph representa- tion is faster. Due to insufficient data, we were unable to analyze which of push-relabel and Edmonds-Karp that is preferable to implement in Java. 

Place, publisher, year, edition, pages
2015.
Keyword [sv]
maxflöde, maxflödesalgoritmer, java, push-relabel, edmonds-karp
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-166434OAI: oai:DiVA.org:kth-166434DiVA: diva2:811043
Supervisors
Examiners
Available from: 2015-05-28 Created: 2015-05-09 Last updated: 2015-05-28Bibliographically approved

Open Access in DiVA

fulltext(941 kB)126 downloads
File information
File name FULLTEXT01.pdfFile size 941 kBChecksum SHA-512
0d7b7e158853e6a41288cff06c720373a1082efe4a90e5d5960f8bb126637e1fd825ac1ffc0cf4b22a528c46fcd28d0572e1689450fad2c8b6860165ba531a19
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Borgström, ErikGrape, Felix
By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 126 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 207 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf