Thesis Details
Hledání nejkratších cest grafem
The aim of this thesis is finding, comparing and implementation of algorithms for finding the shortest paths between each of pairs of nodes in a graph. For this task I use modifications of existing algorithms to achive the lowest time consumption of the computation. Modifications are established on Dijkstra's and Floyd-Warshall's algorithm. We also familiarize with Bellman-Ford algorithm.
algorithm, asymptotic notation, Bellman-Ford algorithm, complete graph, degree of a vertex, Dijkstra's algorithm, directed graph, divide and conquer algorithms, dynamic programming, Floyd-Warshall algorithm, genetic algorithms, graph teory, greedy algorithms, heuristic algorithms, Java, loop, move, Omega, Omicron, paralel algorithms, path, path planning, recursive algorithms, regular graph, sequence, the shortest path, Theta, undirected graph, weighted graph
Křena Bohuslav, Ing., Ph.D. (DITS FIT BUT), člen
Kunovský Jiří, doc. Ing., CSc. (DITS FIT BUT), člen
Motyčka Arnošt, doc. Ing., CSc. (Mendelu), člen
Ryšavý Ondřej, doc. Ing., Ph.D. (DIFS FIT BUT), člen
@bachelorsthesis{FITBT4340,
author = "Petr J\'{a}gr",
type = "Bachelor's thesis",
title = "Hled\'{a}n\'{i} nejkrat\v{s}\'{i}ch cest grafem",
school = "Brno University of Technology, Faculty of Information Technology",
year = 2007,
location = "Brno, CZ",
language = "czech",
url = "https://www.fit.vut.cz/study/thesis/4340/"
}