|
|
Applications Source Code Improvement
Obluková, Alena ; Bartík, Vladimír (referee) ; Kreslíková, Jitka (advisor)
The problem discussed in this master's thesis is to increase the usability of aplication Classycle, especially to increase the comprehensibility of its outputs. Having studied theories of refactoring, testing, graphs and after thorough analysis of Classycle, it has been created new outputs of the application, displaying the output data in graphics form. The application has been tested with real-life data and it is ready to be deploy in company. Thanks to creation of new forms of outputs, which are discribed in practical part of master's thesis, programmer obtains a powerful tool for detection dependences between classes and packages in code.
|
|
|
Vylepšení nástroje na opravu úkolů do předmětu Teorie Grafů
Hrbáček, Pavel
The aim of this diploma thesis is the improvement of a coursework correction tool used in ENC-TG - Graph Theory course. This subject is taught during the follow-up master's degree at the Institute of Informatics at the Mendel University in Brno. The tool will streamline and automate the entire process of correcting algorithms submitted by students attending this course. Part of this thesis delves into graph theory and graph algorithms discussed in the exercises. The result of this diploma work is a web application running on the school server. This application examines submitted algorithms by comparing their results with correct solution employing newly generated graph structures that are initialized using selected parameters.
|
|
|
Scalable dynamic graph-based vehicular routing
Polický, Adam ; Kratochvíl, Miroslav (advisor) ; Švancara, Jiří (referee)
Algorithms for finding shortest paths in large graphs form an essential part of many modern navigation and routing systems. In vehicular navigation, the problem is compli- cated by dynamic nature of the network caused by road closures and changes in traffic, preventing application of many common speed-up techniques. The aim of this thesis is to design an algorithm for finding paths in large graphs that gains efficiency and scalability by minimizing the number of visited graph objects in storage. This was achieved by itera- tively simplifying the graph into a multi-layered approximative structure, and developing a modification of Dijkstra's algorithm that allow efficient navigation in the structure. The results show that the proposed method examines 4× less graph objects than A* and 14× less than Dijkstra, achieving better performance at the cost of slightly longer discovered paths. Additionally, the layered structure is able to accommodate changes in the base graph, allowing the algorithm to work on a changing network without costly recomputations. 1
|
|
|
Applications of graph theory in protein function prediction
Kalábová, Nikola ; Hartman, David (advisor) ; Kratochvíl, Miroslav (referee)
The rapid development of the whole-genome sequencing methods and their reducing cost resulted in a huge number of sequenced genomes. Developing reliable methods for in- silico annotation of the expeditiously growing number of sequenced genomes is the next challenge of modern biology. We described a graph-theoretical approach for function prediction from the protein-protein interaction networks and outlined its strengths and weaknesses. We illustrate the principles of this approach on selected algorithms based on different ideas and provide their comparison and evaluation. 1
|
|
|
Didactic graph visualisation
Frantál, Jiří ; Pergel, Martin (advisor) ; Holan, Tomáš (referee)
This thesis deals with the design of programming language specialized in visu- alisation of graph algorithms, creating its interpreter and integrated development environment. The aim was to make the created program usable for education of graph algorithms and their implementation, especially at high school. Based on didactic knowledge, we designed language similar to Pascal, but adapted for the needs of graph algorithms. Part of the thesis is also brief introduction to inter- preters and several exemplary graphs and algorithms ilustrating work with our program. 1
|
|
|
Automatic Node-Placement in an Oriented Acyclic Graph in a GUI Application
Juda, Jan ; Křivka, Zbyněk (referee) ; Kolář, Dušan (advisor)
The goal of this work is to create an application for automatic node placement of acyclic oriented graphs. The work is mainly focusing on advanced possibilities of graph layout, for example selection of location of selected nodes, division of a graph into sub-graphs or support of polygonal nodes. The solution describes chosen algorithms, which are being used in the resulting application. Specifically, Fruchterman-Reingold force oriented algorithm, algorithm Kamada-Kawai and an algorithm based on Meyer's self-organizing graphs.
|
|
|
Demonstration of Selected Graph Algorithms
Galanská, Katarína ; Martiško, Jakub (referee) ; Křivka, Zbyněk (advisor)
This thesis deals with re-architecture of an existing application for the demonstration and visualization of selected graph algorithms. The goal of this thesis is to convert the application into multiple modules and make it easier to extend. OSGi technology helps to achieve the modularity. Its principles are explained and used to design and implementation of modules. With new architecture is also implemented the support for multilingual user interface using Eclipse Plugin internationalization. Graph algorithms represented as modules use OSGi Services. Dynamicity is ensured by installing the module and registering its service during the program's run time. The implementation also includes the creation of new modules for Prim's, Kruskal's, Edmond Karp's and modified Hierholzer's algorithm.
|
|
|
Mobile robot path planning
Klobušníková, Zuzana ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
This master thesis deals with the planning of the robot's path using selected graph algorithms of artificial intelligence. The theoretical part describes the basic methods of planning a robot's path. It is related to the graph algorithm more closely. The practical part deals with implementation of selected graph algorithms, creation of simulation environment in Python, description and evaluation of experiments.
|
|
| |
|
|
Applications Source Code Improvement
Obluková, Alena ; Bartík, Vladimír (referee) ; Kreslíková, Jitka (advisor)
The problem discussed in this master's thesis is to increase the usability of aplication Classycle, especially to increase the comprehensibility of its outputs. Having studied theories of refactoring, testing, graphs and after thorough analysis of Classycle, it has been created new outputs of the application, displaying the output data in graphics form. The application has been tested with real-life data and it is ready to be deploy in company. Thanks to creation of new forms of outputs, which are discribed in practical part of master's thesis, programmer obtains a powerful tool for detection dependences between classes and packages in code.
|
guest ::
