Library of Efficient Data types and Algorithms

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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.[1] 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 available under Free, Research, and Professional editions. The Free edition is freeware, with source code access available for purchase. The Research and Professional editions require payment of licensing fees for any use.

References[edit]

  1. ^ Mehlhorn, Kurt; Näher, Stefan (1999), LEDA: A Platform for Combinatorial and Geometric Computing, Cambridge University Press, ISBN 978-0-521-56329-1 .

External links[edit]