Algorithms in C, Part 5: Graph Algorithms (3rd Edition) Robert Sedgwick Format:   Paperback, 1200pp    Pub. Date:   September 2001 Publisher:   Pearson Education ISBN:    0201756080 Book Availability: Amazon.com   $34.99 Barnesandnobel.com   $34.99 Booksamillion.com   $34.99 eCampus.com    $24.50

I have worn his Algorithms in Java out. Dave R.

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. Thomas V.