![]() |
GTL, the Graph Template Library GTL can be seen as an extension of the Standard Template Library STL to graphs and fundamental graph algorithms. Graphs are a common model for discrete relational structures, such as diagrams, nets and networks, hierarchies, plans, charts, or maps. And there are many important algorithms for graphs, such us exhaustive search, shortest path, minimum spanning tree, matching or network flow, with a wide range of applications in areas such as Computer Science, Discrete Mathematics, Chemistry, Molecular Biology, Operations Research, Engineering, Computer Aided Design, Project Management, Production Planning, Surveillance, and Maintenance Control, Cartography, and other application areas. The wide use of graphs is also due to the fact that they have a natural graphical representation and Graphlet is a tool for this. GTL is a platform independent and extendible C++ library. It is a useful aid to any software designer. GTL contains the classes needed to work with graphs, nodes and edges and some fundamental algorithms as building blocks for more complex graph algorithms. Further algorithms are under development. Customized algorithms can be developed by experienced programmers. A major step shall be support for models of hierarchically structured graph and the efficient manipulation of really large graphs. GTL has been designed and programmed following the guide lines of STL. To receive an impression what GTL is good for and what people think about it, please have a look at the projects it is employed. |
Contents |
![]() |
|
![]() |
|
![]() |
|
![]() |
|
![]() |
|
![]() |
|
![]() |
|
![]() |
|
![]() |
|
![]() |
![]() |
![]() |
GTL_java is a Java interface for GTL. That means GTL_java offers the GTL graph structure Java. As GTL_java is a interface it is based on GTL and therefore not operating system independend but will work on all operating systems where GTL and Java can run. At the moment GTL_java supports only the basis classes Node, Edge and Graph but will soon support all GTL algorithms.
![]() |
![]() |
With the release of version 1.0.0 the download policy of GTL has been changed. GTL can be downloaded free of charge for non-commercial use. Please follow the steps below to get access to the download archive:
If you intend to use GTL commercially please send an email to brandenb@fmi.uni-passau.de.
![]() |
At the moment the following configurations are supported and tested:
The following configurations are reported to work:
![]() |
GTL was designed and implemented by:
Michael Forster |
![]() |
Andreas Pick |
![]() |
Marcus Raitner |
![]() |
Please direct any suggestions and/or bug report to the appropriate mailing-lists.
![]() |
The following mailing-lists are available:
gtl@infosun.fmi.uni-passau.de Subscription possible. |
Comments an questions about GTL to the GTL Team |
gtl-bugs@infosun.fmi.uni-passau.de | Bug Reports |
gtl-users@infosun.fmi.uni-passau.de Subscription possible. |
General Discussion about GTL |
gtl-announce@infosun.fmi.uni-passau.de | Low traffic, read only list for announcements of new GTL versions. |
All announcements on the gtl-announce list are forwarded to the gtl-users list, so there is no need to subscribe to both.
![]() |
The Graph Template Library (GTL) is copyrighted by the University of Passau. The following terms apply to all files in the GTL distribution:
The authors hereby grant permission to use, copy and modify this software and its documentation for any purpose, except the ones mentioned in this copyright notice, provided that existing copyright notices are retained in all copies. No written agreement, license, or royally fee is required for any of the authorized uses.
Commercial use of GTL without prior written permission is prohibited. GTL must not be distributed without prior written permission. The terms of this copyright notice also apply to any modification to this software.
![]() |
The actual version is 1.0.0, which is the first stable release, after many beta releases.
new_edge
,
del_edge
, etc. are really elements of the graph.
University of Passau
-
FMI
-
Theoretical
Computer Science
Last modified: Wed Mar 7 15:35:53 CET 2001 |