From: Marcus Raitner <raitner@infosun.fmi.uni-passau.de>
Subject: Announcement: GTL-0.3.3
Date: 7 Mar 2000 11:00:07 -0600
Newsgroups: sci.math.research
Summary: [missing]

                     The Graph Template Library - GTL

			    Release 0.3.3


	WHAT IS GTL?
====================

Since we are intensively working with graph algorithms
especially in Graphlet (http://www.fmi.uni-passau.de/Graphlet/),
we decided to implement GTL, a graph library based on STL. For
the design of GTL's API the API of LEDA has served as a basis.
GTL contains the classes needed to work with graphs, nodes and
edges and some basic algorithms as building blocks for more
complex graph algorithms. Further algorithms are under work.



	CHANGES AND FIXES (since 0.3.2):
=======================================   

   * Now really contains Visual C++ project files 
   * Added two partitioning algorithms implemented by Christian
     Bachmaier <bachmaie@fmi.uni-passau.de>.
   * 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. 


	FEATURES:
=================
   
   * Datastructures for handling graphs efficiently.
   * Designed to be extended to fit your own needs. 
   * Basic (extensible) graph algorithms:
        - Depth First Search (DFS)
        - Breadth First Search (BFS)
        - Topological Sorting 
        - Biconnectivity Test
	- Connected Components
        - ST-Numbering
        - Maximum-Flow
	- Partitioning 
   * Planarity Test with planar embedding and detection of 
     subgraph homeomorphic either to K5 or ot K3,3 in case
     graph is not planar. The test is an implementation of the
     Booth and Luecker version of the Lempel, Even, Cederbaum
     algorithm. If the graph is planar, the test takes O(n) time 
     if n is the number of nodes. Tests show that on a Sun Sparc
     Ultra 10 it takes approx. 1.3 sec to test a planar graph
     with 10000 nodes. 
   * GML file format support
     (see http://infosun.fmi.uni-passau.de/Graphlet/)

   
Please refer to our homepage for details.


	AVAILABILITY:
=====================

We are currently using GTL in Graphlet on the following
platforms: 
        
   * Solaris with egcs-1.0.3 or later.
   * Linux with egcs-1.0.3 or later.
   * MS Windows NT/95/98 and Visaul C++ 5.0 Service Pack 3
   * MS Windows NT/95/98 using Visual C++ 6.0 Service Pack 3 

The following configurations are reported to work:	
   
   * HP-UX 9.07 with gcc-2.8.1
   * Free-BSD 4.0 with gcc-2.95.2


The latest version is GTL-0.3.3.
The source code can be downloaded from: 

    http://infosun.fmi.uni-passau.de/GTL/archive/


	HOMEPAGE:
=================

The GTL WWW homepage is

    http://infosun.fmi.uni-passau.de/GTL/  

-- 
--------------------------------------------------------------
Marcus Raitner
Lst. Prof. Brandenburg               raitner@fmi.uni-passau.de
Uni Passau, D-94030 Passau        ++49/851/509-3034, FAX: 3032