|
|
Demonstration of Graph Algorithms
Varadinek, Jakub ; Zámečníková, Eva (referee) ; Křivka, Zbyněk (advisor)
This bachelor thesis deals with the development of the application for demonstration and visualization of several graph algorithms. The application allows the user to create a graph, rate edges or name and layout vertices. The individual algorithms can be performed in created graph for visual observation how the algorithm works. There is also the possibility of stepping through the chosen algorithm and an interactive mode where next steps are selected by the user and the application checks the correctness of these steps.
|
|
|
Shortest Paths in a Graph
Krauter, Michal ; Křivka, Zbyněk (referee) ; Masopust, Tomáš (advisor)
This thesis deals with shortest paths problem in graphs. Shortest paths problem is the basic issue of graph theory with many pracitcal applications. We can divide this problem into two following generalizations: single-source shortest path problem and all-pairs shortest paths problem. This text introduces principles and algorithms for generalizations. We describe both classical and new more efficient methods. It contains information about how some of these algorithms were implemented and offers an experimental comparison of these algorithms.
|
|
|
Systems for remote measurement in power engineering
Hudec, Lukáš ; Mlýnek, Petr (referee) ; Mišurec, Jiří (advisor)
The work deals with the measurement and management in power. Provides an introduction to the problems of remote meter reading, management, and describes the current situation in the field of modern technologies Smart metering and Smart grids. It also analyzed the issue of collection of networks and data collection from a large number of meters over a wide area. For the purpose of data transmission are described GPRS, PLC, DSL, ... Further, there are given options to streamline communication. This area is used hierarchical aggregation. Using k-means algorithm is a program designed to calculate the number of concentrators and their location in the group of meters. The finished program is written in Java. It has a graphical interface and shows how the calculation is conducted. To verify the results of the optimization program is given simulation model in OPNET Modeler tool. Audited results are described in the conclusion and can deduce that using the optimization program is to streamline communications.
|
|
|
Map search engines and their algorithms
Jedlička, Jan ; Chlapek, Dušan (advisor) ; Kuncová, Martina (referee)
This diploma paper, as it results from its title, it puts mind to map search engines and concerning algorithms. It describes two key algorithms, which solve the graph shortest path problem: Dijkstra's algorithm and Floyd-Warshall algorithm, which are specialized on solution procedure and running time of algorithms. A separate chapter is dedicated to map systems in GPS equipments. In the diploma paper the map search engines are described generally; it compares selected applications and examines how the shortest path problem is solved in practice with those applications -- searching for route in between two places on the map. The diploma paper describes the importance of geographic information systems generally, but particularly it concentrates on map services of GIS.
|
guest ::
