Library of Efficient Data types and Algorithms: Difference between revisions
mNo edit summary |
Added sections on Use-Cases and Alternatives along with two new references. |
||
| Line 6: | Line 6: | ||
LEDA is available as Free, Research, and Professional edition. 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. Since October 2017, LEDA graph algorithms are also available for [[Java (software platform)|Java development environment]]. |
LEDA is available as Free, Research, and Professional edition. 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. Since October 2017, LEDA graph algorithms are also available for [[Java (software platform)|Java development environment]]. |
||
== Use-Cases == |
|||
LEDA is particularly useful in the field of [[computational geometry]] due to its support for exact representations of [[Real number|real numbers]] via the leda_real datatype. This provides an advantage in accuracy over [[floating-point arithmetic]]. For example, calculations involving radicals are considerably more accurate when computed using leda_real. <ref name=":0">{{Cite journal|last=Mehlhorn|first=Kurt|last2=Schirra|first2=Stefan|date=2001|title=Exact Computation with leda_real - Theory and Geometric Applications|url=https://people.mpi-inf.mpg.de/~mehlhorn/ftp/leda_real_TGA.pdf|journal=Symbolic Algebraic Methods and Verification Methods|publisher=Springer Verlag|publication-place=Vienna|volume=|pages=|doi=10.1007/978-3-7091-6280-4_16}}</ref> Algorithms under the Real RAM model of computation also benefit from exact representations of real numbers. [[Parametric search]], a technique for solving a subset of optimization problems, relies upon real parameters to provide an accurate result.<ref name=":0" /> |
|||
== Alternatives == |
|||
[[Boost (C++ libraries)|Boost]] and [[LEMON (C++ library)|LEMON]] are potential alternative libraries with some benefits in efficiency due to different implementations of fundamental algorithms and data structures. However, neither employs a similar set of correctness checking, particularly when dealing with floating-point arithmetic.<ref>{{Cite journal|last=Abdulaziz|first=Mohammad|last2=Mehlhorn|first2=Kurt|last3=Tobias|first3=Nipkow|date=9 Jul 2019|title=Trustworthy Graph Algorithms|url=https://arxiv.org/pdf/1907.04065.pdf|journal=MFCS|volume=|pages=|arxiv=1907.04065|via=Arxiv}}</ref> |
|||
==References== |
==References== |
||
Revision as of 01:31, 19 November 2019
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.[2] Since 2001, LEDA is further developed and distributed by the Algorithmic Solutions Software GmbH.
LEDA is available as Free, Research, and Professional edition. 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. Since October 2017, LEDA graph algorithms are also available for Java development environment.
Use-Cases
LEDA is particularly useful in the field of computational geometry due to its support for exact representations of real numbers via the leda_real datatype. This provides an advantage in accuracy over floating-point arithmetic. For example, calculations involving radicals are considerably more accurate when computed using leda_real. [3] Algorithms under the Real RAM model of computation also benefit from exact representations of real numbers. Parametric search, a technique for solving a subset of optimization problems, relies upon real parameters to provide an accurate result.[3]
Alternatives
Boost and LEMON are potential alternative libraries with some benefits in efficiency due to different implementations of fundamental algorithms and data structures. However, neither employs a similar set of correctness checking, particularly when dealing with floating-point arithmetic.[4]
References
- ^ Mehlhorn, Kurt; Näher, Stefan (1999), LEDA: A Platform for Combinatorial and Geometric Computing, Cambridge University Press, ISBN 978-0-521-56329-1.
- ^ "LEDA - A Library of Efficient Data Types and Algorithms". Stony Brook University. Retrieved 21 February 2019.
- ^ a b Mehlhorn, Kurt; Schirra, Stefan (2001). "Exact Computation with leda_real - Theory and Geometric Applications" (PDF). Symbolic Algebraic Methods and Verification Methods. Vienna: Springer Verlag. doi:10.1007/978-3-7091-6280-4_16.
- ^ Abdulaziz, Mohammad; Mehlhorn, Kurt; Tobias, Nipkow (9 Jul 2019). "Trustworthy Graph Algorithms" (PDF). MFCS. arXiv:1907.04065 – via Arxiv.
External links
 | This computer-library-related article is a stub. You can help Wikipedia by expanding it. |