%T A Visualization System for Correctness Proofs of Graph Algorithms
%A Peter A. Gloor
%A Donald B. Johnson
%A Fillia Makedon
%A Panagiotis Metaxas
%R Technical Report PCS-TR92-180
%I Dartmouth College, Computer Science
%C Hanover, NH
%D  1992
%U http://www.cs.dartmouth.edu/reports/TR92-180.pdf
%X
 	In this paper we describe a system for visualizing correctness
 proofs of graph algorithms.  The system has been demonstrated for a
 greedy algorithm.  PrimÕs algorithm for finding a minimum spanning
 tree of an undirected, weighted graph.  We believe that our system is
 particularly appropriate for greedy algorithms, though much of what we
 discuss can guide visualization of proofs in other contexts.  While an
 example is not a proof, our system provides concrete examples to
 illustrate the operation of the algorithm.  These examples can be
 referred to by the user interactively and alternatively with the
 visualization of the proof where the general case is portrayed
 abstractly.