|
Algorithms in C, Part 5: Graph Algorithms (3rd Edition)
 |
Author: Robert Sedgewick
List Price: $39.99
Our Price: Click to see the latest and low price
ISBN: 0201316633
Publisher: Addison-Wesley Pub Co (16 August, 2001)
Edition: Paperback
Sales Rank: 163,905
Average Customer Rating: 5 out of 5
|
Customer ReviewsRating: 5 out of 5
A must-have reference for Graph Algorithms
As students in Robert Sedgewick's Algorithms and Data Structures Course at Princeton, we had the privilege of reading Part 5 of Algorithms in C in a preprint edition this spring. Its treatment of Graph Algorithms is as thorough and comprehensive as the treatment of sorting and searching in parts 1-4. The algorithms discussed range from the fundamental (Depth-first search, Dijkstra's algorithm), to the relatively obscure (Gabow's strong component algorithm), to the impossibly difficult (Network Simplex), all in great detail. The book also discusses real-world applications of these algorithms, such as arbitrage. It contains a good number of useful diagrams allowing step-by-step traces of the algorithms, which helps decipher the sometimes cryptic code.
A warning: the book is DENSE. It is packed with detailed information and can be a difficult read, especially the mathematical analysis of the algorithms. All in all, a great book, though.
Similar Products
· Exceptional C++: 47 Engineering Puzzles, Programming Problems, and Solutions
· Data Structures Using C
· Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching (3rd Edition)
· Introduction to Algorithms, Second Edition
|
