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 adds several fixes for bugs which have been revealed by the current efforts at test automation. Most fixes concern the graph drawing functionalities.
Release Notes: The stability on some platforms has been improved by cleaning up general memory management faults. The build process has been revised with respect to private installations. Shared objects are used instead of statically linked code.
Release Notes: The makefile was revised and now supports private installations. A major bug in the planarity test was fixed: it correctly handles non-2-connected graphs now. The reference manual has been brought into line.
Release Notes: The TSP branch and bound code was revised. This has improved the performance of the symmetric TSP code, and the ATSP code was debugged. Now one can display Hamiltonian cycles, color classes, and node orderings by a circular layout method.
Release Notes: Several bugs in the min-cost flow solver have been fixed. A multi-terminal variant of the shortest augmenting path method has been added. The GUI has also been revised (alignment of slave windows and synchronisation of the label editor with other GUI functionality).
Release Notes: The matching code has been debugged extensively. Some GUI defects have been fixed.
Release Notes: A couple of bugs have been fixed, mainly in the network flow solvers. An excess scaling implementation of the max-flow preflow-push method was added.
Release Notes: The source code now compiles with gcc 3.4.x.
Release Notes: The memory management was revised. Several memory leaks have been cleaned up. A serious bug in the planar colouring method is fixed.