Next: Classes(LEDA) Prev: Introduce(LEDA) Up: LEDA Top: Top

3.3.2. Features

LEDA is a library of efficient data types and algorithms. Its main features are:

a sizable collection of data types and algorithms: this includes stacks, queues, lists, sets, dictionaries, ordered sequences, partitions, priority queues, directed, undirected, and planar graphs, lines, points, planes and basic algorithms in graph and network theory and computational geometry;

the precise and readable specification of data types and algorithms;

the inclusion of many of the most recent and efficient implementations;

a comfortable data type graph;

its extendibility;

its ease of use.

The library employs

a strict separation between abstract data types and the concrete data structures used to implement them,

parameterized data types, and object oriented programming.