This REU project will focus on extending the library of available animations. Some examples of algorithms which need animations include, but are not limited to: variations of network flow algorithms, matching, topological sorting, transitive closure, and graph partitioning. Although LINK already provides a flexible C++ library of graph objects, a scheme environment for interpretive manipulation of these objects, and a good graphical interface, designing and implementing animations for graph algorithms is a challenging problem. The project will involve finding good implementations of algorithms; C++ programming to implement algorithms using LINK's object libraries (and/or to adapt existing algorithms code); as well as using visualization and imagination to create effective computer animations.
See LINK for additional information and to download LINK software.