Home | Documentation | Download | Platforms | Projects | Mailing Lists | Version History

{ Version History } The most recent version is 1.2.4.

- 1.2.4
  - Fixes for computing the obstruction set in planarity test.
- 1.2.3
  - Fixes for forall_x loops. Thanks to Joachim Börger.
- 1.2.2
  - Fixes for lateset gcc (>= 3.4.x).
- 1.2.1
  - Bugfixes in the bidirectional Dijkstra
  - Fixes for the latest Visual Studio .NET
- 1.2.0
  - New algorithm added: Bidirectional Dijkstra's shortest path
  - A lot of bugfixes
  - Revised documentation
- 1.1.0
  - Returned to the libtool versioning style
  - New algorithms added
    - Dijkstra's shortest path
    - Bellman Ford shortest path
    - New variant of Maximal Flow
  - graph::load now creates nodes in the same order as they are in the gml file
  - graph::load now with parameter 'preserve_ids' to use the same ids as in the gml file
  - A lot of bugfixes
  - Documentation adapted to doxygen
- 1.0.0
  - First stable release
  - quick fix of bug in graph::del_node (thanks to David Auber)
  - bug fix in graph::hide_node (thanks to David Auber)
  - optimization of reallocation procedure in node_ and edge_maps (again, thanks to David)
- 0.3.3
  - Now really contains project-files for Visual C++.
  - Added two partitioning algorithms implemented by Christian Bachmaier.
  - Added algorithm for connected components
  - Added methods to change the source or target of an edge
  - Some more assertions added. Mostly to check if the arguments to `new_edge`, `del_edge`, etc. are really elements of the graph.
- 0.3.2
  - Changed the names for the max-flow algorithms
  - Revised and extended documentation
- 0.3.1
  - Added two max-flow algorithms implemented by Christian Bachmaier See the manual for details.
- 0.3.0
  - graph: added new constructor to create an isomorphic induced subgraph
  - biconnectivity: added option to make an arbitrary graph biconnected. Added accessor function for the additional edges.
  - planarity: fixed bug in pq-tree (the labels of direction indicators were not cleared correctly after a reduction)
  - planarity: added switches for embedding, kuratowski graphs and for using the new make_biconnected of biconnectivity test.
  - planarity changed the strategy for finding the pertinent leaves in reduction.
- 0.2.6
  - One nasty bug in planarity test fixed, which made the test crash in a lot of cases.
  - Fixed bug in biconnectivity algorithm: The edges in a biconnected component were not correctly detected.
- 0.2.5
  - Added detection of subgraphs homeomorphic to either K5 or K3,3 in case that the graph is not planar.
  - Added support for graphs with multiple edges and selfloops in planarity test.
  - fixed some bugs in planarity test.
- 0.2.4
  - several bugfixes in planarity-test; especially in the embedding part.
  - made hide/restore of nodes and edges more efficient.
  - planarity-test for graphs which are not biconnected now runs in O(n), too; this was achieved by a more efficient strategy for hiding and restoring biconnected components.
  - redisigned homepage.
- 0.2.3
  - Windows compatibility: now everything can be used on Windows platforms, too. Especially the planarity test now works on windows.
  - Bug fixes:
    - planarity test: fixed some rather nasty bugs
    - symmetric list bug: So far only occurred in planarity test and is fixed now.
  - Some more documentation (it still is rather poor,but who needs a manual when he has the header files ;-)
- 0.2.2
  - Again bug fixes.
- 0.2.1
  - Minor bug fixes, especially in the GML support and in some algorithms.
  - More algorithms:
    - st-numbering,
    - planarity test (ALPHA !!)
  - Data structures added:
    - pq-trees (needed for planarity testing, at the moment tailored to that purpose, but will become a template class)
    - planar embedding.
    - symmetric list; very much like the STL class list, but can be reversed in constant time
- 0.2.0
  - Removed all deprecated classes and methods.
  - Introduced new algorithm concept. The basic algorithms like DFS and BFS are no longer implemented as member functions of the graph class for the following reasons:
    - These algorithms have a lot of options and variations which can hardly be handled in only *one* function call.
    - All the algorithms produce some data which has to stored and handled efficiently. Since the data belongs inherently to the algorithms thought it a good idea to tie it somehow to the algorithm itself.
    - Some algorithms are small extensions of others, e.g. the biconnectivity test adds only a few lines to the standard DFS algorithm.
    Thus we thought it would be a good solution to make all algorithms classes, which are derived from one base class implementing the interface common to all algorithm.
  - Added GML support. GML is a very flexible description language we use as file format for our graphs
- 0.1.0 Please note that this is a very early alpha release of GTL. It probably contains many bugs and its interfaces may change in details. Especially the classes and methods declared as 'deprecated' are likely to be removed for the final version.

University of Passau - FMI - Theoretical Computer Science

Design © 2002--2005 Marcus Raitner, University of Passau