LEDA is a library of efficient data types and algorithms. At present, its strength is graph algorithms and related data structures. 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.
|
At present, the data types stack, queue, list, set, dictionary, ordered sequence, priority queue, directed and undirected graph and partition are available. Based on these data types a variety of network algorithms (shortest paths, matchings, network flow, planarity testing and embedding, ...) and geometric algorithms (plane sweep, Voronoi digrams, ...) are included.
This research was supported by the ESPRIT II Basic Research Action Program, ESPRIT P. 3075 — ALCOM, and by the DFG, grant SPP Me 620/6-1.