Abstract
LEDA is a library of efficient data types and algorithms. At present, its strength is graph algorithms and related datstructures. The computational geometry part is evolving. The main features of the library are
-
a clear separation of specification and implementation
-
parameterized data types
-
its extendibility
-
its ease of use.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Reference
K. Mehlhorn and S. Näher: “LEDA, a library of Efficient Data Types and Algorithms”, MFCS 89, LNCS Vol. 379, 88–106, Springer 1989
S. Näher: “LEDA User Manual Version 2.0”, Technical Report A 17/90, Fachbereich Informatik, Universität des Saarlandes, Saarbrücken 1989
S. Näher and K. Mehlhorn: “LEDA, a Library of Efficient Data Types and Algorithms”, Technical Report A 04/89, Fachbereich Informatik, Universität des Saarlandes, Saarbrücken 1989
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Näher, S., Mehlhorn, K. (1992). LEDA — A Library of Efficient Data Types and Algorithms. In: Dette, K. (eds) PC-Einsatz in der Hochschulausbildung. Reihe Mikrocomputer-Forum für Bildung und Wissenschaft , vol 3. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-84839-1_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-84839-1_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55878-1
Online ISBN: 978-3-642-84839-1
eBook Packages: Springer Book Archive