Vizualizace grafových algoritmů

Abstract

This bachelor's thesis deals with developing program for visualising the course of different graph algorithms. Initially, it outlines theoretical foundation of graph theory and graph algorithms. Afterwards, it focuses closely on description of some graph algorithms, which are used in the final program. The thesis suggests various forms of visualising graphs and graph algorithms. Forms of visualisation of secondary information generated during the activity of algorithm are not neglected. Impact of those forms on understanding the algorithms is taken to consideration. Subsequently, individual parts of program are designed with regard to requirements. Technologies for making development easier are described. After that, the thesis describes implementation solutions of the program parts themselves, whether it is user interface or internal logic. While describing these solutions, reasons are given for the decisions made and the issue of sustainable program development is examined.