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

Robert Sedgewick has thoroughly rewritten and substantially expanded his popular work to provide current and comprehensive coverage of important algorithms and data structures. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers! Whether you are a student learning the algorithms for the first time or a professional interested in having up-to-date reference material, you will find a wealth of useful information in this book. -- 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 toconfidently implement, debug, and use the algorithms he covers.

Describes the most important known methods for solving the graph processing problems that arise in computing applications. The algorithms address diagraphs, minimum spanning trees, shortest paths, and network flow. A new emphasis on abstract data types makes the third edition more relevant to object-oriented programming. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Title Page Copyright Page Preface Dedication Notes on Exercises Contents PART FIVE: Graph Algorithms CHAPTER SEVENTEEN: Graph Properties and Types CHAPTER EIGHTEEN: Graph Search CHAPTER NINETEEN: Digraphs and DAGs CHAPTER TWENTY: Minimum Spanning Trees CHAPTER TWENTY-ONE: Shortest Paths CHAPTER TWENTY-TWO: Network Flow References for Part Five Index Algorithms in C++ contains exercises to help students learn the properties of algorithms with a greater emphasis on abstract data types, modular programming, object oriented programming and C++ classes Providing exercises to help students learn the properties of algorithms, this text places a greater emphasis on abstract data types, modular programming, object-oriented programming and C++ classes.