LEDA: A Platform for Combinatorial and Geometric Computing
by Kurt Mehlhorn
On This Page
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 show more 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. show lessTags
Members
- Recently Added By
Author Information
7 Works 115 Members
Classifications
- Genres
- Technology, Nonfiction
- DDC/MDS
- 005.133 — Computer science, information & general works Computer science, knowledge & systems Artificial Intelligence/Virtual Reality Software development Computer programming Specific programming languages
- LCC
- QA76.73 .C153 .M44 — Science Mathematics Mathematics Instruments and machines Calculating machines Electronic computers. Computer science
- BISAC
Statistics
- Members
- 13
- Popularity
- 1,770,645
- Languages
- English
- Media
- Paper
- ISBNs
- 2
