Leda: A Platform for Combinatorial and Geometric Computing

by Kurt Mehlhorn

In the core computer science areas--data structures, graph and network algorithms, and computational geometry--LEDA is the first library to cover all material found in the standard textbooks. Written in C++ and freely available worldwide on a variety of hardware, the software is installed at hundreds of sites. This book, written by the main authors of LEDA, is the definitive account of how the system operates and how it can be used. The authors supply...

• Format: Hardcover
• Language: English
• ISBN: 0521563291
• ISBN13: 9780521563291
• Release Date: November 1999
• Publisher: Cambridge University Press
• Length: 1034 Pages
• Weight: 4.45 lbs.
• Dimensions: 2.2" x 8.0" x 10.0"

Customer Reviews

A must-read for every serious scientific programmer

I've never read a book like this before. It teaches you very complexalgorithms *and* how to prove their correctness *and* their concreteimplementation in C++ *and* how to prove the correctness of the givenimplementation *and* how to speed up the implementation *and* theproper use of the fantastic LEDA-library *and* the underlying objectoriented design *and* how to do fine software engineering.I've really read every single line of this book, even every singleline of code and I'm filled with enthusiasm. It is definitely amust-read for every scientific programmer who wishes to improve hisstyle of programming, the correctness and speed of his code, his timespent for coding, or who just wants to learn about the most important datastructures and their implementation and how to borrow them from theaward winning LEDA library instead of inventing the wheel twice.This book finishes the time of boring pseudocode lyricists who teachyou how and why an algorithm and his data structures work, but not howyou can *get* them to work.

Essential for those who are interested in LEDA

LEDA library is one of the best library ever built to combine efficient data structures with extensive algorithms, ( ). Particularly the readability of the code is one of the best. This book is essential for those who want to know more about LEDA and the theory behind it. From the point of view of a computational geometer, the book shows a nice and detailed presentation of the theory and its implementation in practice. Especially I like the pseudo code part in the book.