National Repository of Grey Literature 3 records found  Search took 0.01 seconds. 
The Shortest Graph's Pahts Finding
Jágr, Petr ; Ohlídal, Miloš (referee) ; Jaroš, Jiří (advisor)
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.
Demonstration Program of Sorting Methods in C Language
Pernica, Lukáš ; Křena, Bohuslav (referee) ; Honzík, Jan M. (advisor)
The one of the basic skill of every computer programer in the subject of Information technology is to manage the problems of the sorting algorithm. Sorting algorithms are used in the very wide range and though they are writed differently in a different programming language, their principal remains same. At this work I'm going to deal with the problems of sorting algorithm and description of the program, which is part of this bachelor's thesis. The program have to demonstrate by the simple way the principles of the most used sorting algorithms and give us the clue to easier understanding of the sorting methods.
The Shortest Graph's Pahts Finding
Jágr, Petr ; Ohlídal, Miloš (referee) ; Jaroš, Jiří (advisor)
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.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.