LEDA (Library of Efficient Datatypes and Algorithms) is a library of the
data types and algorithms of combinatorial computing. The main features are:
- LEDA provides a sizable collection of data types and algorithms in a form which allows them to be used by
non-experts. In the current version, this collection includes most of the data types and algorithms
described in the text books of the area.
- LEDA gives a precise and readable specification for each of the data types and algorithms mentioned
above. The specifications are short (typically, not more than a page), general (so as to allow several
implementations), and abstract (so as to hide all details of the implementation).
Current Version: 4.2
License Type: Free for academic research and teaching. A
commercial license is also available.
http://www.algorithmic-solutions.com/ (Commercial License)
Source Code Availability:
Available Binary Packages:
- Debian Package: No
- RedHat RPM Package: No
- Other Packages: No
LEDA is implemented by a C++ class library. It can be used with
almost any C++ compiler (cfront2.1, cfront3.0, g++, borland, zortech)
Tested on SunOS, Solaris, IBM AIX, HP-UX, Linux, SGI, DOS,
Windows 3.1/95/NT, OS/2, DEC Alpha.
See http://www.mpi-sb.mpg.de/LEDA/www/ledainfo.html for details.
Mailing Lists/USENET News Groups:
Mailing List: join by a mail to firstname.lastname@example.org
News Group: comp.lang.c++.leda
- "First of all I want to thank you for LEDA, it's really a blessing! I'm
recommending it to everyone around me."
- "I install LEDA-R-3.4.1 since it seems to be very convenient and thanks
a lot for this package!"
See A Screen Shot?
Copyright © 1995-2001 by
Copyright © 1997-2001 by
Kachina Technologies, Inc.
All rights reserved.