| Name : GTL
| |
| Version : 0.3.3
| Vendor : University of Passau
|
| Release : 1
| Date : 2000-03-07 10:00:44
|
| Group : Development/Libraries
| Source RPM : GTL-0.3.3-1.src.rpm
|
| Size : 2.63 MB
| |
| Packager : Marcus Raitner < raitner_fmi_uni-passau_de>
| |
| Summary : The Graph Template Library
|
Description :
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 for 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.\'
|
RPM found in directory: /vol/rzm1/linux-ibiblio.old/libs |
