LEDA : a platform for combinatorial and geometric computing
Author(s)
Bibliographic Information
LEDA : a platform for combinatorial and geometric computing
Cambridge University Press, 1999
Available at / 36 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliography (p. 992-1001) and index
"LEDA (Library of Efficient Data types and Algorithms) is a C++ library of combinatorial and geometric data types and algorithms." -- pref.
Description and Table of Contents
Description
LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing on which application programs can be built. In each of the core computer science areas of data structures, graph and network algorithms, and computational geometry, LEDA covers all (and more) that is found in the standard textbooks. LEDA is the first such library; it is written in C++ and is available on many types of machine. Whilst the software is freely available worldwide and is installed at hundreds of sites, this is the first book devoted to the library. Written by the main authors of LEDA, it is the definitive account, describing how the system is constructed and operates and how it can be used. The authors supply ample examples from a range of areas to show how the library can be used in practice, making the book essential for all workers in algorithms, data structures and computational geometry.
Table of Contents
- Preface
- 1. Introduction
- 2. Foundations
- 3. Basic data types
- 4. Numbers and matrices
- 5. Advanced data types
- 6. Graphs and their data structures
- 7. Graph algorithms
- 8. Embedded graphs
- 9. The geometry kernels
- 10. Geometry algorithms
- 11. Windows and panels
- 12. GraphWin
- 13. On the implementation of LEDA
- 14. Manual pages and documentation
- Bibliography
- Index.
by "Nielsen BookData"
