LEDA

From Wikipedia, the free encyclopedia

The Library of Efficient Data types and Algorithms (LEDA) is a software library providing 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.

[edit] References

  1. ^ Mehlhorn, Kurt & Näher, Stefan (1999), LEDA: A Platform for Combinatorial and Geometric Computing, Cambridge University Press, ISBN 978-0521563291 .
 This software-related article is a stub. You can help Wikipedia by expanding it.