School of Computing

Graph Algorithm Animation with Grrr

Peter J. Rodgers and Natalia Vidal

In Agtive99: Applications of Graph Transformations with Industrial Relevance, LNCS, pages 182-196. Springer-Verlag, 2000.

Abstract

We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and profiling of Grrr code, but recently it has been extended for the purpose of teaching algorithms to undergraduate students. The animation is restricted to graph based algorithms such as graph drawing, list manipulation or more traditional graph theory. The visual nature of the Grrr system allows much animation to be gained for free, with no extra user effort beyond the coding of the algorithm, but we also discuss user defined animations, where custom algorithm visualisations can be explicitly defined for teaching and demonstration purposes.

Download publication 1071 kbytes (PostScript)

Bibtex Record

@inproceedings{895,
author = {Peter J. Rodgers and Natalia Vidal},
title = {{Graph Algorithm Animation with Grrr}},
month = {unknown},
year = {2000},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2000/895},
    booktitle = {Agtive99: Applications of Graph Transformations with Industrial Relevance},
    publisher = {Springer-Verlag},
    refereed = {Yes},
    series = {LNCS},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014