GTL (Graph Template Library) The Standard Template Library (STL) is an extremely flexible implementation of many container classes and standard algorithms. Unfortunately, STL has no support for graphs and graph algorithms. However, graphs are widely used for complex relational structures. Since we are intensively working with graph algorithms especially in 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.

Current Version:   0.3.2 License Type:   Free for non-commercial use

Home Site: http://www.infosun.fmi.uni-passau.de/GTL/ http://www.fmi.uni-passau.de/Graphlet/GTL/ Source Code Availability:   Yes Available Binary Packages: Debian Package:   No RedHat RPM Package:   Yes, from Home Site Other Packages:   No Targeted Platforms: Solaris, Linux (with egcs 1.0.3 or later), MS Windows NT/95/98 Software/Hardware Requirements: C++ compiler

Other Links: http://www.fmi.uni-passau.de/archive/archive.theory/ftp/GTL/ Mailing Lists/USENET News Groups: Couples of mailing lists: 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) User Comments: None See A Screen Shot? (Not Yet)

  SAL Home   |   Computer Graphics, Images & Signals   |   Misc