The Algorithm Design Manual
About the Book
Programming Challenges

The Stony Brook Algorithm Repository

Steven Skiena
Stony Brook University
Dept. of Computer Science

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 Files (local site)
  • Algorithmic Solutions(now sole distributor of LEDA)
  • Offical Website

    Recommended Books

    Leda : A Platform for Combinatorial and Geometric Computing by Kurt Mehlhorn and Stefan Naher

    Problem Links

    Dictionaries (10)
    Graph Data Structures (10)
    Planarity Detection and Embedding (10)
    Connected Components (9)
    Robust Geometric Primitives (9)
    Priority Queues (9)
    Topological Sorting (9)
    Edge and Vertex Connectivity (8)
    Network Flow (8)
    Point Location (8)
    Range Search (8)
    Set Data Structures (8)
    Convex Hull (7)
    Intersection Detection (7)
    Matching (7)
    Matrix Multiplication (7)
    Shortest Path (7)
    Voronoi Diagrams (6)
    Minimum Spanning Tree (5)
    Nearest Neighbor Search (5)
    Searching (5)
    Transitive Closure and Reduction (5)
    Triangulation (5)
    Determinants and Permanents (4)
    Generating Graphs (4)
    Arbitrary Precision Arithmetic (4)
    Maintaining Line Arrangements (4)
    Graph Partition (3)
    Solving Linear Equations (3)
    Random Number Generation (2)

    This page last modified on 2008-07-10 .