Back to search

Šimon Soták

Bachelor's thesis

Experimental evaluation of heuristic improvements of the Bellman-Ford algorithm

Experimental evaluation of heuristic improvements of the Bellman-Ford algorithm
Abstract:
Cieľom tejto bakalárskej práce je implementovať a následne experimentálne porovnať Bellman-Fordov algoritmus a jeho heuristiky. Konkrétne s dve Yenove rozšírenia, Tarjanovo rozšírenie a ich kombinácie.
Abstract:
The objective of this bachelor's thesis is to implement and experimentally compare the Bellman-Ford algorithm and its' heuristic improvements, specifically two Yen's improvements and a Tarjan's improvement.
 

Keywords

directed graph shortest path node source relaxation weight pointer graph tree dynamic programming C#
 
Language used: English
Date on which the thesis was submitted / produced: 16. 12. 2019
Identifier: https://is.muni.cz/th/nli81/

Thesis defence

  • Date of defence: 13. 2. 2020
  • Supervisor: RNDr. Nikola Beneš, Ph.D.
  • Reader: prof. RNDr. Ivana Černá, CSc.

Citation record

Cite this text

Full text of thesis

Contents of on-line thesis archive
Published in Theses:
  • světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatiky
Složka Reference to the local database directory of the institution