Abstract

This paper describes a new method of graph algorithm visualization based on a dynamic approach. Graph algorithms are algorithms processing graphs. The main advantages of this approach are the possibility to set an algorithm as an input parameter, to set the graph as an input parameter, and also to adjust visualization flexibly. Visualization of algorithms is carried out by means of a set of configurable visual effects. The class of hierarchical graphs is used as an input parameter. This allows using any type of input graphs and presenting additional data appearing during the algorithm work as part of a single visualized graph model. This approach can be used both in research and for education.

Keywords

DOI

10.31144/bncc.cs.2542-1972.2012.n34.p93-103

File

gordeev.pdf202.93 KB

Pages

93-103