Využití úlohy o Hamiltonovských cestách v grafu v praxi

Abstract

Thesis deals with the applications of graph theory, focusing on their use in solving Hamilton’s problems. In the first part of the thesis is the notion of graph theory, which is required to work with Hamilton‘s problems. In other parts of the thesis there are the theoretical aspects describing Hamilton‘s paths and the circles. The types of Hamilton‘s problems are presented here and indicated the possibilities of reciprocal transfers of these problems. Furthermore in this part of the thesis are described possible solutions for finding Hamilton‘s paths and circles and explained the graphic method of decision tree for solutions of the travelling salesman problem. In other parts of the thesis is processed by the practical application of the travelling salesman problem solved using graphic method design decision tree.