Introduction

The Library of Efficient Data types and Algorithms (LEDA) is a proprietarily-licensed software library providing C++ implementations of a broad variety of algorithms for graph theory and computational geometry. It was originally developed by the Max Planck Institute for Informatics Saarbrücken. Since 2001, LEDA is further developed and distributed by the Algorithmic Solutions Software GmbH.

LEDA is our C++ class library for efficient data types and algorithms. LEDA provides algorithmic in-depth knowledge in the field of graph- and network problems, geometric computations, combinatorial opimization and other. LEDA is implemented following the object-oriented approach.

Usage

Notes

People

1. Jinhui Xu, requestor.

References

1. http://en.wikipedia.org/wiki/Library_of_Efficient_Data_types_and_Algorithms
2. http://www.algorithmic-solutions.com