|C++ DAG, one answer firstname.lastname@example.org (1994-08-03)|
|From:||email@example.com (Sanjay Kumar)|
|Organization:||University of Texas at Arlington|
|Date:||Wed, 3 Aug 1994 22:39:20 GMT|
This is one response I received . Since some people have contacted me
by e-mail to direct any response to them, I'm posting it.
Sanjay> Hi, I'm looking for anyone who has experimented with, or has
Sanjay> any pointers to a suitable, coarse/medium grain directed
Sanjay> acyclic graph (DAG) for C++.
Check out the LEDA toolkit.
A Library of Efficient Data Types and Algorithms
Max-Planck-Institut f"ur Informatik
Im Stadtwald, 6600 Saarbr"ucken, FRG
The LEDA library of efficient data types and algorithms is available via
LEDA-3.0.tar.Z template version
LEDA-N-3.0.tar.Z non-template version
LEDA-30.zip DOS template version
LEDA-N30.zip DOS non-template version
unzip.exe DOS unzip program
* The template version should be used with cfront-3.0.1 or g++-2.3
* LEDA is not in the public domain, but you can use and distribute it freely
for research and teaching (a commercial license is available from the
* Do not distribute modified sources. Please report discovered bugs,
critics, suggestions, and any changes you make.
* Send a message to firstname.lastname@example.org if you want to be on the LEDA user
mailing list (mainly used for announcing of new versions).
Return to the
Search the comp.compilers archives again.