Contents Up << >>

LEDA, A Library of Efficient Data Types and Algorithms

Author: Stefan Nä from Germany.

It is available for educational purposes but its NOT in the public domain.

Provides basic data-types like lists, stacks, queues, trees, sets, partitions, priority queues and a few others. These are parameterizable classes, you may add your own datatype and have a priority queue ... An important datatype is a graph, these are also parameterizable and there are useful algorithms for them like shortest path, transitive closure, matching, maximum flow, spanning tree and others, we have implemented a few algorithms for dealing with perfect graphs, but these ar not part of the standard library. The latest part deals with computational geometry.

It can be used with C++ compilers which understand templates, such as cfront 3.0 and g++ 2.4.5.

	Stefan Naeher
	Max-Planck-Institut fuer Informatik
	Im Stadtwald, 
	6600 Saarbruecken, 
	Germany
	(stefan@mpi-sb.mpg.de)
ftp from ftp.mpi-sb.mpg.de in /pub/LEDA/LEDA-<version>.tar.Z