|
|
Graphs and Shortest Path Algorithms
Hamerník, Michal ; Nowák, Jiří (referee) ; Bobalová, Martina (advisor)
This bachelor thesis represents an educational text focused on graph theory and graph algorithms. The graph theory often helps to solve problems between parts of a complicated unit and graph algorithms are quick and effective in their optimization. Basics of graph theory, samples of graph algorithms and practical examples of use are described in it. This thesis can be used as a supplementary text in Discrete Mathematics taught at Faculty of Business and Management in Brno University of Technology.
|
|
| |
|
|
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.
|
|
|
GPS Navigation system for cement technology
Mináč, Ján ; Zemánek, Pavel (referee) ; Zezulka, František (advisor)
This diploma work deals with proposal and implementation GPS navigation system. Work includes described basic types of cement quarry and proposal to create mathematical and software model of quarry. Then work is devoted to possibilities of basic described algorithms for searching the shortest way in graph and two algorithms are described. They are Floyd-Warshall and Dikjstra algorithms. The work describe implementation of Dijkstra algorithm to model of quarry and description of the programs Autec RouteEditor and AQL Control Library. MINÁČ, J. GPS navifgation system for cement for cement technology. Brno: Brno university of technology, Faculty of electrical engineering and communication, 2009. 90 p. Supervisor prof. Ing. František Zezulka, CSc.
|
|
|
Analysis of Data Flow in the Fly-by-Wire System
Kubínová, Zuzana ; Tomáš, Jan (referee) ; Matoušek, Radomil (advisor)
Software implementovaný v rámci Fly-by-Wire systému firmy Honeywell je složen z mnoha modelů implementovaných v systému Simulink. Tato práce se zabývá hledáním přímých a nepřímých spojitostí mezi jednotlivými signály v systému těchto modelů. Jako vhodný aparát je zvolena teorie grafů. Na základě modelů jsou vygenerovány grafy a úloha nalézt spojitost mezi signály je převedena na úlohu nalézt cestu mezi dvěma vrcholy grafu. Známé algoritmy k vyhledávání cest v grafech určují délku nebo váhu nalezené cesty. Pro tuto aplikaci je ale potřeba rozlišovat cesty primární a sekundární bez ohledu na jejich délku. Proto jsou tyto známé algoritmy upraveny.
|
|
|
Shopping Advisor
Kocourek, Jakub ; Bartík, Vladimír (referee) ; Kolář, Dušan (advisor)
The attached bachelor thesis deals with nding the shortest ways in a shop for the selected purchase. The different technologies of creating web pages are described. As for the state space search algorithms are given for nding the shortest path between two points and for solving the travel salesmen problem. The thesis continues with the description of a design and implementation of application with all used technologies (PHP, Nette, MySQL, JS, JQuery) applying the Dijkstra's algorithm for nding the shortest path and genetic algorithm for solving the travel salesmen problem.
|
|
| |
|
|
Preparation of Homeworks in the Course Algorithms
Miloš, Roman ; Masopust, Tomáš (referee) ; Lukáš, Roman (advisor)
This Bachelor's thesis is about preparing of homeworks for the course Algorithms on graphs. Thesis contains five parts. The first task is to create graphs using adjacency matrix, next is to create a graph using the adjacency lists. The third task is to implement Prim algorithm for finding the minimum skeleton. The fourth is the implementation of Floyd-Warshall algorithm for finding minimum paths in the graph, finding the connection and completeness of the graph. The fifth task is to identify and implement discretion chart NP-complete problem of finding a maximum clique of graph.
|
|
| |
|
|
Graphs and Shortest Path Algorithms
Hamerník, Michal ; Nowák, Jiří (referee) ; Bobalová, Martina (advisor)
This bachelor thesis represents an educational text focused on graph theory and graph algorithms. The graph theory often helps to solve problems between parts of a complicated unit and graph algorithms are quick and effective in their optimization. Basics of graph theory, samples of graph algorithms and practical examples of use are described in it. This thesis can be used as a supplementary text in Discrete Mathematics taught at Faculty of Business and Management in Brno University of Technology.
|
guest ::
