The complete, up-to-date guide to the best graph algorithms for C++ programming.
Far more than a "revision": a major rewrite, five times as long as the previous edition -- with new commentary, new exercises, new figures, and dozens of new programs!
Includes diagrams, sample C++ code, and detailed descriptions designed to enable practical implementation.
Covers each major category of graph algorithms: Graph search, directed graphs, minimal spanning trees, shortest paths, and networks.
Graph algorithms are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. The latest in Robert Sedgewick's classic series on algorithms, this is the field's definitive guide to graph algorithms for C++. Far more than a "revision," this is a thorough rewriting, five times as long as the previous edition, with a new text design, innovative new figures, more detailed descriptions, and many new exercises -- all designed to dramatically enhance the book's value to developers, students, and researchers alike. The book contains six chapters covering graph properties and types, graph search, directed graphs, minimal spanning trees, shortest paths, and networks -- each with diagrams, sample code, and detailed descriptions intended to help readers understand the basic properties of as broad a range of fundamental graph algorithms as possible. The basic properties of these algorithms are developed from first principles; discussion of advanced mathematical concepts is brief, general, and descriptive, but proofs are rigorous and many open problems are discussed. Sedgewick focuses on practical applications, giving readers all the information and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he covers. (Also available: Algorithms in C++: Parts 1-4, Third Edition, ISBN: 0-201-35088-2).
There are no customer reviews available at this time. Would you like to write a review?
Addison Wesley Professional
January 05, 2002
Number of Print Pages*
Adobe DRM EPUB
* Number of eBook pages may differ. Click here for more information.