All releases tagged Major feature enhancements
Release Notes: This release addresses perfect graphs: a linear test for chordality and co-chordality has been added. Constructors for permutation, threshold, and interval graphs are also available. BFS, the max-flow code, and non-weighted matching code have been revised, and now operate on the node color register (integer) instead of the node distance labels.
Release Notes: The GUI now supports partial upload of the transcript file. This considerably reduces the response time after computations. It is now possible to step back in the transcript while computations are running.
Release Notes: All network flow methods are now applicable to undirected graphs. The so-called staircase algorithm has been implemented for planar orthogonal layout.
Release Notes: All graph internal, array-like data structures have been replaced by special objects (attributes) that depend on STL vectors. Such objects can be accessed from outside of the graph objects now. The graph loader has been rewritten so that no special order of attributes is required any longer. Both the file and the internal representation have become much more extensible.
Release Notes: A tool kit for series-parallel graphs has been added. This includes recognition, topologic embedding, and 1-visibility drawing of directed, undirected, and mixed edge series parallel graphs. The shell tool is stable again on the AIX / xlC platform.
Release Notes: A couple of methods for layered drawings have been implemented. These can be used for drawing graphs based on arc orientations and on node colours. For this goal, a half approximating heuristic for minimum feedback arc sets was also added.
Release Notes: The visibility representation code was refined: it no longer assumes 2-connectivity, and it can produce GIOTTO drawings by shrinking the node segments. The planar force directed drawing code has been debugged, and now actually produces readable planar straight line drawings.
Release Notes: Two fundamental algorithms for orthogonal graph drawings were added: 1-bent Kandinski drawings for general graph objects, and 2-bent drawings with small nodes for 2-connected graphs with maximum node degree 4 or less. The latter method gives plane drawings when the input graph is planar.
Release Notes: The Makefile has been revised. A preliminary version of the GPLK plugin is now available. An editor mode for sorting incidence lists and an initial version of a planarity test have been added.
Release Notes: The browser now supports linear programs. Several bugs with the simplex code have been fixed. A text display for unembedded graphs has been added.
