Customer Reviews

LEDA: A Platform for Combinatorial and Geometric Computing

5 star:		(2)
4 star:		(0)
3 star:		(0)
2 star:		(0)
1 star:		(0)

 

 

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.

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
line of code and I'm filled with enthusiasm. It is definitely a
must-read for every scientific programmer who wishes to improve his
style of programming, the correctness and speed of his code, his time
spent for coding, or who just wants to learn about the most important data
structures and their implementation and how to borrow them from the
award winning LEDA library instead of inventing the wheel twice.

This book finishes the time of boring pseudocode lyricists who teach
you how and why an algorithm and his data structures work, but not how
you can *get* them to work.