LEDA is a library of efficient data types and algorithms. At present, its strength is graph algorithms and the data structures related to them. The computational geometry part is evolving. The main features of the library are
| 1) |
a clear separation of specification and implementation
|
| 2) |
parameterized data types
|
| 3) |
a comfortable data type graph, and
|
| 4) |
its ease of use.
|