Home > Search Results: keywords:"the shortest path"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 5 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.
Detailed record
Graphs and Graph Algorithms
 Matulová, Nadežda ; Novotná, Veronika (referee) ; Bobalová, Martina (advisor)
This thesis contains basic introduction to the graph theory with the characteristic of chosen graph algorithms for solving tasks linked to the shortest path problem in graphs. Thesis tries to clarify the ways of finding a solution and pros and cons of all the mentioned algorithms.
Detailed record
Graphs and Graph Algorithms
 Matulová, Nadežda ; Novotná, Veronika (referee) ; Bobalová, Martina (advisor)
This thesis contains basic introduction to the graph theory with the characteristic of chosen graph algorithms for solving tasks linked to the shortest path problem in graphs. Thesis tries to clarify the ways of finding a solution and pros and cons of all the mentioned algorithms.
Detailed record
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.
Detailed record
The algorithm for seeking the shortest path used in a traffic network - adjustments relative to current restrictions of the network
 Kohout, Pavel ; Kuncová, Martina (advisor) ; Tichý, Vladimír (referee)
The content of this bachelor thesis is formed by introduction and description of selected algorithms for seeking the shortest path in a graph, and by demonstration of theirs utilization. I concentrate on a practical problem on which I demonstrate an operation of the algorithm in respect to a traffic network with restrictions using real data. Apart from that, my target is to describe some realms where these algorithms could be used. Special emphasis is given to available solution and their problems. The goal of this thesis is to increase knowledge about these algorithms and to support their usage and further improvement.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English