LEDA - A Library of Efficient Data Types and Algorithms
LEDA - A Library of Efficient Data Types and Algorithms
LEDA ("Library of Efficient Data types and Algorithms") has been developing
since 1988 under the efforts of a group at the Max Planck Institut in
Saarbrucken Germany (including Kurt Melhorn, Stefan Naher, Stefan Schirra,
Christian Uhrig, and Christoph Burnikel). The success of LEDA has been a
direct result of a continuous resource investment on the part of its
algorithmically sophisticated development team.
Implemented in C++ using templates, LEDA may be compiled on a wide range of
systems (older compilers may not support templates, but most new C++
compilers provide facilities to implement this feature). The standard
distribution contains source code, installation information, and a complete
user's manual. Please note that LEDA is
not in the public domain
,
but may be used freely for research and teaching. Commercial licenses are
availabe through the LEDA home page.
LEDA comprises an extensive collection of data structures and types.
Libraries of algorithms using these data types are provided, with examples
illustrating the ease with which algorithmic tasks may be accomplished given
the LEDA data types.
Download LEDA Files (German site)
Download LEDA files (local site)
Go to LEDA Home Page
Problem Links
Dictionaries (10)
Graph Data Structures (10)
Priority Queues (9)
Connected Components (8)
Robust Geometric Primitives (8)
Intersection Detection (7)
Maintaining Line Arrangements (7)
Matching (7)
Planarity Detection and Embedding (7)
Point Location (7)
Range Search (7)
Searching (7)
Shortest Path (7)
Topological Sorting (7)
Convex Hull (6)
Minimum Spanning Tree (6)
Nearest Neighbor Search (6)
Transitive Closure and Reduction (6)
Triangulation (6)
Voronoi Diagrams (6)
Generating Graphs (5)
Arbitrary Precision Arithmetic (5)
Network Flow (5)
Set Data Structures (5)
Graph Partition (4)
Matrix Multiplication (4)
Random Number Generation (4)
Solving Linear Equations (3)
Determinants and Permanents (2)
About the Book
Send us Mail
Go to Main Page
This page last modified on Feb 23, 1996.