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 1) a clear separation of specification and implementation 2) parameterized data types 3) a comfortable data type graph, 4) its extendibility, and 5) its ease of use
This report provides an (updated) overview of Grafalgo, an open-source library of graph algorithms a...
A graph drawing algorithm produces a layout of a graph in two- or three-dimensional space that shoul...
zAlthough there are many advanced and specialized texts and handbooks on algorithms, until now there...
LEDA is a library of efficient data types and algorithms. At present, its strength is graph algorith...
LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geomet...
Contents Preface page xi 1 Introduction 1 1.1 Some Programs 1 1.2 The LEDA System 8 1.3 The LED...
LEDA is a library of efficient data types and algorithms in combinatorial and geometric computing. ...
LEDA is a library of efficient data types and algorithms in combinatorial and geometric computing. T...
Efficiency, flexibility, and ease of use are desirable goals in library development, but it seems ne...
This paper explains some implementation details of graph iterators and data accessors in LEDA. It sh...
We report on a software library of dynamic graph algorithms. It was written in \CC as an extension o...
We report on the use of program checking in the LEDA library of efficient data types and algorithms
We report on the use of program checking in the LEDA library of efficient data types and algorithms
The goal of the LEDA project was to build an easy-to-use and extendable library of correct and effic...
In the CGAL startup meeting in Zürich, September 1996, it has turned out that iterators on highly st...
This report provides an (updated) overview of Grafalgo, an open-source library of graph algorithms a...
A graph drawing algorithm produces a layout of a graph in two- or three-dimensional space that shoul...
zAlthough there are many advanced and specialized texts and handbooks on algorithms, until now there...
LEDA is a library of efficient data types and algorithms. At present, its strength is graph algorith...
LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geomet...
Contents Preface page xi 1 Introduction 1 1.1 Some Programs 1 1.2 The LEDA System 8 1.3 The LED...
LEDA is a library of efficient data types and algorithms in combinatorial and geometric computing. ...
LEDA is a library of efficient data types and algorithms in combinatorial and geometric computing. T...
Efficiency, flexibility, and ease of use are desirable goals in library development, but it seems ne...
This paper explains some implementation details of graph iterators and data accessors in LEDA. It sh...
We report on a software library of dynamic graph algorithms. It was written in \CC as an extension o...
We report on the use of program checking in the LEDA library of efficient data types and algorithms
We report on the use of program checking in the LEDA library of efficient data types and algorithms
The goal of the LEDA project was to build an easy-to-use and extendable library of correct and effic...
In the CGAL startup meeting in Zürich, September 1996, it has turned out that iterators on highly st...
This report provides an (updated) overview of Grafalgo, an open-source library of graph algorithms a...
A graph drawing algorithm produces a layout of a graph in two- or three-dimensional space that shoul...
zAlthough there are many advanced and specialized texts and handbooks on algorithms, until now there...
DOI
Add to ORKG