Virginia Tech Algorithm Visualization Research Group Website

This website contains a number of algorithm visualizations developed at Virginia Tech, and other software that we are hosting or mirroring here for our convenience.

You might want to check out our Data Structure and Algorithm Visualization Wiki. The AlgoViz Wiki is our comprehensive portal to research related to algorithm visualizations. It includes a comprehensive collection of links to algorithm visualizations for common data structures and algorithms, the relevent research literature, and practical information on developing algorithm visualizations.

Here are pointers to some associated tools:

Algorithm visualizations created at Virginia Tech:

Update as of January 24, 2007: All of the above visualizations are GPL'd (version 2.0) now. That is, their source files contain the standard GPL boilerplate text at the top of each one. You can get a copy of the actual GPL either from us or the FSF.

In the mid 1990's, we developed Swan, a system for building visualizations of data structures by annotating C++ programs with calls to a visualization library. While Swan is no longer under active development or support, a number of interesting visualizations were developed. These run as MS Windows applications. Note that along with each demo executable is a brief document that desribes its use, and some demos come with sample data files. The demos available include: BST, Heapsort, Huffman coding trees, the Knuth-Morris-Pratt string match algorithm, Network flow, Red-Black trees, topological sort, Vertex Covers, and a lower bounds proof for the cost of finding the minimum and maximum of a collection of elements.

See our poster.

If you want to get involved, check out these projects that need doing.