| |
| |
| |
|
Graphs, Graph Algorithms and their Use in Finding the Shortest Path
Ott, Lukáš ; Moravec, Petr (referee) ; Bobalová, Martina (advisor)
This Bachelor thesis concentrates on introducing graphs and graph algorithms theories for finding the shortest path and consequential implementation of acquired pieces of knowledge into program MS Excel 2003 using VBA language. Chart theory applies to everything, from small problems to complex actions. If we are able to understand the basic pieces of knowledge presented in this thesis, we will also be able to put them into practice.
|
|
Graphs, Algorithms and their Application
Venerová, Lenka ; Dostál,, Jiří (referee) ; Bobalová, Martina (advisor)
The Bachelor thesis is primarily focused on the problems of graphs and graph algorithms. The main point is to explain and to enlarge the subject. Very often, we find ourselves confronted with problems, which we, though unconsciously, solve by means of the graph algorithms knowledge. Therefore, the other aim of my bachelor thesis is to demonstrate the application of some of these methods in solving distribution tasks.
|
| |
|
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.
|
| |
|
Classification of Grammars, Languages and Machines (Basic Types, Use)
Klimešová, Michaela ; Novotný, Jan (referee) ; Bobalová, Martina (advisor)
This bachelor's thesis is written as a brief list of fundamental theory on the given topic with extensions of working out methods and solving examples. The thesis is divided into two basic parts. The first part is focused on the essential theoretical pieces of knowledge about languages, grammars and machines. There is a particular explanation of the theory related to formal languages and operations on languages, grammars and their separation, and to finite state machines, together with dividing them into deterministic and nondeterministic ones. The second part is devoted to working out, explanation and calculation of the examples applied to the given topic - from the simple ones to the difficult ones.
|
| |