Reasoning about graph algorithm visualization

Abstract

A method of graph algorithm visualization based on an implicit visual effect generation approach is described. The approach develops an idea to establish an algorithm as an input as well as input graph. Visualization of algorithms is carried out by means of a set of configurable visual effects. We consider a class of hierarchical graphs as a class of input graphs. This allows using wide set of input graphs and presenting additional data appearing during the algorithm work as part of a single visualized graph model. Described approach is be used both in research and education.