Graph algorithms are easy to visualize and, indeed, there already exists a variety of packages and programs to animate the dynamics when solving problems from graph theory. Still, and somewhat surprisingly, it can be difficult to understand the ideas behind the algorithm from the dynamic display alone.
CATBox consists of a software system for animating graph algorithms and a course book available from Springer which we developed simultaneously. The software presents both the algorithm and the graph, and puts the user always in control of the actual code that is executed. He or she can set breakpoints, proceed in single steps and trace into subroutines. The graph, and additional auxiliary graphs like residual networks, are displayed and provide visual feedback. The course book, intended for readers at the advanced undergraduate or graduate level, introduces the ideas and discusses the mathematical background necessary for understanding and verifying the correctness of the algorithms and their complexity. Computer exercises and examples replace the usual static pictures of algorithm dynamics.
For this volume we have chosen solely algorithms for classical problems from combinatorial optimization, such as minimum spanning trees, shortest paths, maximum flows, minimum cost flows, weighted and unweighted matchings both for bipartite and non-bipartite graphs.
We consider non-bipartite weighted matching, in particular in the geometrical case, a highlight of combinatorial optimization. In order to enable the reader to fully enjoy the beauty of the primal-dual solution algorithm for weighted matching, we present all mathematical material not only from the point of view of graph theory, but also with an emphasis on linear programming and its duality. This yields insightful and aesthetically pleasing pictures for matchings, but also for minimum spanning trees.
Explore all of the algorithms included in CATBox online at the WebGato site. This alternative to the desktop Gato software provides an online presentation allowing forward and backward animations of all algorithms used in the book with a selection of graph instances.
From the 1.2.5 release onwards it is possible to generate HTML files for playing your own animations over the web with the desktop Gato desktop software.
There are two main parts to the CATBox software: The open-source animation software Gato and the algorithm implementations. Gato is copyright © 2016-2021 Alexander Schliep, copyright © 1998-2015, Alexander Schliep and Winfried Hochstättler, and copyright © 1998-2001 ZAIK/ZPR, Universität zu Köln, Germany. It is licensed under the LGPL. In addition there are algorithm implementations, algorithm visualizations and problem instances which are © 1998-2021, Winfried Hochstättler and Alexander Schliep and © 2010 Springer Verlag.
The files below contain Gato and CATBox version 1.2.7 which has been released on 1/25/2021. Changes in this release include:
- Still Python 2.7, but cleanup for Python 3.x.
- Paned modus is now default.
--separatecommand line options for old standard behaviour with two graph windows.
- Added replay (r), undo (u), do (d) key commands alllowing to play back animation commands (used to be experimental).
- Fixed bugs in undo command.
- Fixed bugs in WM interaction.
- Enabled SVG export of graph in current animation state and saving of animations as HTML.
|Archive containing only the CATBox algorithms source files. Use when installing Gato from PyPi.
|Archive containing CATBox and Gato source files.
|CATBox files including Gato binaries for MacOS X 10.15 (not tested on other versions of MacOS).
|CATBox installer including Gato and Gred binaries and CATBox-Algorithms for Windows 10.