GDR: A visualization tool for graph algorithms
Matthias F. M. Stallmann, Rance Cleaveland, Prashat Hebbar · DIMACS series in discrete mathematics and theoretical computer science · 1994
. This paper describes GDR, a tool for editing graphs and animating graph algorithms. The design of GDR emphasizes simplicity and the ability to interact with other tools. GDR has been used to implement classroom animations of graph algorithms and finite automata, and as a research tool for prototyping algorithms. 1. Introduction GDR (for Graph Drawing) is a tool for editing graphs and animating graph algorithms. The motivation for animation tools comes primarily from the classroom; students often have difficulty mastering the formal concepts of graph theory, even though they usually have no trouble in following the associated visual intuitions. An appropriate animation tool can provide an invaluable link between formalism and graphical intuition, since students are given the opportunity to see how a formal presentation of a graph algorithm directly translates into visually intuitive operations on graphs. For this reason, animation tools can also play a useful research role as testbed...