|
|
UGE - Import/Export
Kádek, Tibor ; Polášek, Petr (referee) ; Smrčka, Aleš (advisor)
This thesis deals with creating graphs in application UGE (Universal graphic editor) and facilities it offers for plugins programmers. Goal of the thesis is to design UGML (UGE Graph Markup Language) data format, implement plugin for importing/exporting graph, implement SVG graphic format export and export into several bitmap formats. Thesis extends particular parts of application, especially API (application program interface) and manipulating graphical representation of objects.
|
|
| |
|
|
Dynamic Definable Dashboard
Počatko, Boris ; Burget, Radek (referee) ; Šebek, Michal (advisor)
This thesis deals with the design and implementation of a dynamic user-definable dashboard. The user will be able to define conditions dynamically, which will filter out and save only the data he needs. The application will support the changing of the condition definitions and the display of the graphs after they were created. The current implementations available on the internet are usually solutions designed to fit only one type of project and are not designed to meet general guidelines for a dashboard. The dashboard is designed for a smooth cooperation with high load databases and therefore not to slow down the whole solution.
|
|
|
Implementation of Ford-Fulkerson Algorithm
Makovský, Benjamin ; Rychnovský, Lukáš (referee) ; Masopust, Tomáš (advisor)
This work describes the design of the graphic implementation of the Ford-Fulkerson Algorithm for searching the maximum flow and the minimal cut in the network. It contains a brief introduction with the theory of the graphs and the flows in the networks, it describes the principle of the Ford-Fulkerson Algorithm. The object design representing the graph in the program is cited, the drawing of the graph by the program and the creation of the graphic user interface of the application is described. The final program is worked up as a Java applet which is placed at the public internet pages www.ffaplikace.php5.cz.
|
|
|
Implementing Edge Clustering for Graphs
Klimčíková, Iveta ; Charvát, Lukáš (referee) ; Smrčka, Aleš (advisor)
The objective of the thesis is to explore graph layout and edge clustering to improve graph visibility and the overall edge crossings. A summary of tools focusing on improving of graph visualisation is given. The thesis describes in more details a method of geometry--based edge clustering. Further, the method is implemented in a C++ library. The library itself can handle both simple and more complex graphs with a lot of vertices and edges.
|
|
|
An Interactive DNA Computing Simulator
Kovács, Martin ; Petrlík, Jiří (referee) ; Bidlo, Michal (advisor)
The aim of this work is to summarize the basic principles of operations performed over DNA molecules and to demonstrate their usage in solving some hard mathematical problems. In particular, the Hamiltonian Path Problem -- HPP (also known as the Traveling Salesman Problem) will be considered as a case study. A fundamental approach introduced by Leonard Adleman will be desctribed to solve the HPP using the DNA operations. His work may be considered as the first experiment in the area that is currently known as DNA computing. The goal of this bachelor thesis is to implement an interactive software simulator (based on the principles and formal models of Adleman's work) for solving the HPP and to evaluate its abilities with respect to area complexity considering various instances of HPP.
|
|
|
Analysis of dynamic effects acting on the turnout constructions
Hajniš, Jan ; Vukušič, Ivan (referee) ; Smutný, Jaroslav (advisor)
Author´s name: Jan Hajniš School: Technical University - VUT, Brno Faculty of Civil Engineering Veveří 331/95, 602 00 Brno Program: Construction and Transportation Engineering Title: Analysis of dynamic effects acting on the turnout constructions Consultant: Prof. Ing. Jaroslav Smutný, Ph.D. Number of pages: about 70 + attachments Number of attachments: about 40 Year: 2012 This work describes the size and the process of dynamic effect – vibrations and shift – cockles in crossing panel and switch panels of the turnout constructions on steel and concrete sleepers in time and frequency domain. It compares the results of the measurement between these turnout constructions. Dynamic effects are undesirable physical phenomena for operation each train. It is therefore necessary to eliminate these phenomena as much as possible. The result of this test will by means of software programm and measuring set help to determine precisely the advantages and disadvantages of using both turnout constructions, or even to propose their improvements or dimensions.
|
|
| |
|
|
Graphical Tool for Creation and Modification of Graphs
Hynšt, Miroslav ; Navrátil, Jan (referee) ; Zuzaňák, Jiří (advisor)
This paper deals with basics of the graph theory and graph rewriting. In the first part there is described a graph, graph rewriting systems, graph grammar and algebraic approach to the graph rewriting. In the second part of this paper there is analyzed an implementation of the designed aplication for creation, modification and saving graphs and graph rewrite systems.
|
|
|
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.
|
guest ::
