![]() |
There are some basic data structures and algorithms that are frequently used in many programs. This includes container classes such as vectors, sets and lists. Many commercial but some free libraries have implemented these data structures and algorithms in a general way. This makes them usable for many purposes. One of these libraries is the Standard Template Library (STL), an extremely flexible implementation of many container classes and standard algorithms. STL is supposed to become a part of the C++ standard library and therefore is an ideal basis when writing portable programs. Unfortunately, STL has no support for graphs and graph algorithms. However, graphs are widely used to model complex relational structures. Since we are intensively working with graph algorithms and 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. To get 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.
![]() |
![]() |
![]() |
||
GTL-0.3.3.tar.gz | Source distribution of GTL | |
GTL-0.3.3.zip | ||
GTLJava-0.1.0.tar.gz | Java interface for GTL | GTLJava-0.1.0.zip |
![]() ![]() |
||
GTL-0.3.3-1.i386.rpm | Binary | |
GTL-0.3.3-1.src.rpm | Source | |
![]() |
||
GTL-0.3.3.ps | ||
![]() |
||
GTLTest.tar.gz | Demo showing the usage of GTL. | |
GTLTest.zip | ||
GTLJavaTest.tar.gz | Demo showing the usage of GTL-Java | |
GTLJavaTest.zip |
Older version are available at: http://infosun.fmi.uni-passau.de/GTL/archive/.
![]() |
At the moment the following configurations are supported and tested:
The following configurations are reported to work:
The Java interface is tested under:
![]() |
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 | 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 | General Discussion about GTL |
gtl-announce@infosun.fmi.uni-passau.de | Low traffic, read only list for announcements of new GTL versions. |
You can subscribe to the the gtl-announce or gtl-users list by sending mail to gtl-announce-request@infosun.fmi.uni-passau.de or gtl-users-request@infosun.fmi.uni-passau.de with the single word "subscribe" in the body of the message.
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 0.3.3, which works well at least for our own project Graphlet
new_edge
,
del_edge
, etc. are really elements of the graph.
University of Passau
-
FMI
-
Theoretical
Computer Science
Last modified November 23, 1999 |