e2204ecc2c
(STL), which is supposed to become a part of the C++ standart library and therefore is an ideal basis when writing portable programs. For the design of the GTL's API the API of LEDA is used as a base. 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. Unfortunately, STL has no support for graphs and graph algorithms. However, graphs are widely used to model complex relational structures. MAINTAINER= Peter Valchev <pvalchev@toxiclinux.org>
4 lines
194 B
Plaintext
4 lines
194 B
Plaintext
MD5 (GTL-0.3.3.tar.gz) = 3fc4653715b8d3b32f9bee3f4ea01252
|
|
RMD160 (GTL-0.3.3.tar.gz) = dbfa6b83cb975331db37a75caedd096a080c40df
|
|
SHA1 (GTL-0.3.3.tar.gz) = 5cf7baab5ec299045fc9f8df455cb32be39cb736
|