|
|
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.
|
|
|
Graph theory and its applications
Huclová, Alena ; Karásek, Jiří (referee) ; Pavlík, Jan (advisor)
It is often necessary to be oriented in the complicated relations between parts of a unit. This problem can be solved by the graphs’ theory very well. Graph G is an ordered pair (V,E) where V is a non-empty set of vertices (our parts of the unit) and E is a set of two-element subsets of the set V called arcs (i.e. relations between parts of the unit). G= (V,E) The graph aplication is frequently hidden. It is not found in the solution of the problem, but could be used to express and substantiate it quite easily. In my work I will deal with optimization problems of a graph. Problem of the maximum network flow that we solve using directed graph can be an example. As for non-directed graphs, we will be interested in the search of a minimum frame of a 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.
|
|
|
Graph theory and its applications
Huclová, Alena ; Karásek, Jiří (referee) ; Pavlík, Jan (advisor)
It is often necessary to be oriented in the complicated relations between parts of a unit. This problem can be solved by the graphs’ theory very well. Graph G is an ordered pair (V,E) where V is a non-empty set of vertices (our parts of the unit) and E is a set of two-element subsets of the set V called arcs (i.e. relations between parts of the unit). G= (V,E) The graph aplication is frequently hidden. It is not found in the solution of the problem, but could be used to express and substantiate it quite easily. In my work I will deal with optimization problems of a graph. Problem of the maximum network flow that we solve using directed graph can be an example. As for non-directed graphs, we will be interested in the search of a minimum frame of a graph.
|
guest ::
