Vizualizace grafových algoritmů

Abstract

As part of this work, a web application was created, which allows the user, for learning purposes, to visualize the progress of various graph algorithms on a user-created graph. The application provides the visualization of Depth-first search, Breadth-first search, Dijkstra’s algorithm, Tarjan’s algorithm for finding strongly connected components and Tarjan’s algorithm for finding biconnected components. The application can, however, be expanded to include other graph algorithms. The application also allows for easy and interactive editing of the graph, manual and automatic control of the algorithm vizualization, display of information about the graph during vizualization, and also the option to save and load the created graph from a file.