Version 2.8b27 of GOBLIN Graph Library
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.
Other releases
Release Notes: A stupid bug with the Tcl wrapper of the new constructors for interval, permutation, and threshold graphs was fixed.
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 Tcl API has been completely revised to conform with the method names in the C++ core library. Tcl commands now consistently support optional parameters. The HTML reference now covers all graph methods in the Tcl API. A constructor method for k-ary (cyclic) butterfly graphs has been added.
Release Notes: Several contructor methods for non-planar, regular graphs are now provided: Moebius ladders, generalized Petersen graphs, generalized Kneser graphs, and torus grid graphs. A couple of bugs in the layout code have been fixed. The Tcl API was further cleaned up and documented.
Release Notes: This release features several bugfixes of different areas, and a redesign of handling graph layout parameters. The Tcl interface has been cleaned up, and layout parameters are now associated with particular graph objects rather than the controller objects.
