Original title: Grafy a algoritmy pro hledání nejkratších cest
Translated title: Graphs and Shortest Path Algorithms
Authors: Hamerník, Michal ; Nowák, Jiří (referee) ; Bobalová, Martina (advisor)
Document type: Bachelor's theses
Year: 2009
Language: cze
Publisher: Vysoké učení technické v Brně. Fakulta podnikatelská
Abstract: [cze] [eng]

Keywords: Bellman-Ford algorithm; Dijkstra´s algorithm; directed graph; Floyd-Warshall algorithm; Johnson´s algorithm; non-directed graph; shortest path algorithms; algoritmy pro hledání nejkratších cest; Bellman-Fordův algoritmus; Dijkstrův algoritmus; Floyd-Warshallův algoritmus; Johnsonův algoritmus; 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/15027

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


The record appears in these collections:
Universities and colleges > Public universities > Brno University of Technology
Academic theses (ETDs) > Bachelor's theses
 Record created 2016-06-03, last modified 2022-09-04


No fulltext
  • Export as DC, NUŠL, RIS
  • Share