BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR92-180
ENTRY:: January 20, 1995
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: A Visualization System for Correctness Proofs of Graph Algorithms
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Gloor, Peter A.
AUTHOR:: Johnson, Donald B.
AUTHOR:: Makedon, Fillia
AUTHOR:: Metaxas, Panagiotis
NOTE:: The 'January' in DATE is an arbitrary placeholder.
DATE:: January 1992
RETRIEVAL:: For a paper copy, email <reports@cs.dartmouth.edu>
RETRIEVAL:: For a paper copy, write to
       Technical Report Librarian
       Department of Computer Science
       Dartmouth College
       6211 Sudikoff Laboratory
       Hanover, NH 03755-3510
       USA
RETRIEVAL:: PDF at http://www.cs.dartmouth.edu/reports/TR92-180.pdf
ABSTRACT::
	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.
END:: ncstrl.dartmouthcs//TR92-180