Original title: Grafy, grafové algoritmy a jejich využití
Translated title: Graphs, Graph Algorithms and their Application
Authors: Pavlásek, Ondřej ; Novotná,, Veronika (referee) ; Bobalová, Martina (advisor)
Document type: Bachelor's theses
Year: 2010
Language: cze
Publisher: Vysoké učení technické v Brně. Fakulta podnikatelská
Abstract: [cze] [eng]
Práce predstavuje text zamerený na problematiku teorie grafu, popisuje jednotlivé grafové algoritmy a charakterizuje jejich praktické použití. Shrnuje výhody a nevýhody každého z nich a podává vysvětlení, který je vhodný použít za dané situace. This bachelor thesis represents text focused on graph theory, describes individual graph algorithms and distinguish practical examples of their use. Thesis summarizes advantages and disadvantages each of the algorithm and mention which one is suitable to use in certain situations.
Keywords: Bellman-Ford algorithm; BFS; DFS; Dijkstra´s algorithm; directed graph; Floyd-Warshall algorithm; Graph; Johnson´s algorithm; Minimum spanning tree; undirected graph; Bellman-Forduv algoritmus; BFS; DFS; Dijkstruv algoritmus; Floyd-Warshalluv algoritmus; Graf; Johnsonuv algoritmus.; minimální kostra grafu; neorientovaný graf; orientovaný graf

Institution: Brno University of Technology (web)
Document availability information: Fulltext is available in the Brno University of Technology Digital Library.
Original record: http://hdl.handle.net/11012/1094

Permalink: http://www.nusl.cz/ntk/nusl-246096


The record appears in these collections:
Universities and colleges > Public universities > Brno University of Technology
Academic theses (ETDs) > Bachelor's theses