Algorithms in C, Part 5: Graph Algorithms (3rd Edition) (Graph...

Features

• Cover Type: Paperback with 512 pages
• Published by: Addison-Wesley Professional
• Edition: 3rd Edition August 26, 2001
• Written in: English
• ISBN 10 Number: 0201316633
• ISBN 13 Number: 978-0201316636
• Book Dimensions: 9 x 7.7 x 0.8 inches
• Weighs: 1.6 pounds

Book Info
(Pearson Education) Text providing a comprehensive introduction to important algorithms in C, concentrating on graph algorithms. Covers diagraphs and DAGs, shortest paths, minimum spanning trees, network flows, sample C code, and detailed algorithm descriptions. Previous edition not cited. Softcover. DLC: C (Computer program language).

Back Cover Copy

Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In this book, Sedgewick offers the same successful blend of theory and practice with concise implementations that can be tested on real applications, which has made his work popular with programmers for many years.

Algorithms in C, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick's thoroughly revised and rewritten series. The first book, Parts 1-4, addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book's expanded coverage features new algorithms and implementations, enhanced descriptions and diagrams, and a wealth of new exercises for polishing skills. A focus on abstract data types makes the programs more broadly useful and relevant for the modern object-oriented programming environment.

Coverage includes:

• A complete overview of graph properties and types
• Diagraphs and DAGs
• Minimum spanning trees
• Shortest paths
• Network flows
• Diagrams, sample C code, and detailed algorithm descriptions

The Web site for this book (http://www.cs.princeton.edu/~rs/) provides additional source code for programmers along with numerous support materials for educators.

A landmark revision, Algorithms in C, Third Edition, Part 5 provides a complete tool set for programmers to implement, debug, and use graph algorithms across a wide range of computer applications.

0201316633B08022001

Reader Reviews
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.