|
| Login | Sign up | My Wish List |
![]() | LEDA: A Platform for Combinatorial and Geometric Computing by Kurt Mehlhorn, Stefan Näher ISBN-10: 9780521563291 ISBN-10: 0-521-56329-1 ISBN-13: 9780521563291 ISBN-13: 978-0-521-56329-1 Hardcover 1999-11-28 Cambridge University Press Find Lowest Price | |
Editorials | ||
Product Description 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 plentiful examples from a range of areas to show practical uses of the library, making the book essential for all researchers in algorithms, data structures and computational geometry. | ||
Book Description LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing. In each of the core 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 and this is the first book devoted to it. Written by the main authors of LEDA it is the definitive account, making the book essential for all workers in algorithms, data structures and computational geometry. | ||
Reviews | ||
A must-read for every serious scientific programmer I've never read a book like this before. It teaches you very complex algorithms *and* how to prove their correctness *and* their concrete implementation in C++ *and* how to prove the correctness of the given implementation *and* how to speed up the implementation *and* the proper use of the fantastic LEDA-library *and* the underlying object oriented design *and* how to do fine software engineering. I've really read every single line of this book, even every single This book finishes the time of boring pseudocode lyricists who teach | ||
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. | ||