Algorithms in C++ Part 5 Graph Algorithms

by Sedgewick, Robert

• ISBN13: 9780201361186
• ISBN10: 0201361183
• Edition: 3rd
• Format: Paperback
• Copyright: 2001-12-27
• Publisher: Addison-Wesley Professional

Summary

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 that has made his work popular with programmers for many years. Christopher van Wyk and Sedgewick have developed concise new C++ implementations that both express the methods in a natural and direct manner and also can be used in real applications. 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: bull; 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 a wide range of academic 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. 0201361183B11282001

Author Biography

Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He earned his Ph.D from Stanford University under Donald E. Knuth.

0201361183AB06262002

Table of Contents

Graph Algorithms
Graph Properties and Types	3	(78)
Glossary	7	(9)
Graph ADT	16	(9)
Adjacency-Matrix Representation	25	(6)
Adjacency-Lists Representation	31	(5)
Variations, Extensions, and Costs	36	(10)
Graph Generators	46	(10)
Simple, Euler, and Hamilton Paths	56	(14)
Graph-Processing Problems	70	(11)
Graph Search	81	(68)
Exploring a Maze	82	(5)
Depth-First Search	87	(4)
Graph-Search ADT Functions	91	(7)
Properties of DFS Forests	98	(7)
DFS Algorithms	105	(7)
Separability and Biconnectivity	112	(9)
Breadth-First Search	121	(10)
Generalized Graph Search	131	(9)
Analysis of Graph Algorithms	140	(9)
Digraphs and DAGs	149	(78)
Glossary and Rules of the Game	152	(8)
Anatomy of DFS in Digraphs	160	(9)
Reachability and Transitive Closure	169	(13)
Equivalence Relations and Partial Orders	182	(4)
DAGs	186	(5)
Topological Sorting	191	(10)
Reachability in DAGs	201	(4)
Strong Components in Digraphs	205	(11)
Transitive Closure Revisited	216	(5)
Perspective	221	(6)
Minimum Spanning Trees	227	(50)
Representations	230	(10)
Underlying Principles of MST Algorithms	240	(7)
Prim's Algorithm and Priority-First Search	247	(11)
Kruskal's Algorithm	258	(6)
Boruvka's Algorithm	264	(3)
Comparisons and Improvements	267	(7)
Euclidean MST	274	(3)
Shortest Paths	277	(90)
Underlying Principles	285	(8)
Dijkstra's Algorithm	293	(11)
All-Pairs Shortest Paths	304	(9)
Shortest Paths in Acyclic Networks	313	(9)
Euclidean Networks	322	(6)
Reduction	328	(17)
Negative Weights	345	(18)
Perspective	363	(4)
Network Flow	367	(120)
Flow Networks	373	(9)
Augmenting-Path Maxflow Algorithms	382	(28)
Preflow-Push Maxflow Algorithms	410	(15)
Maxflow Reductions	425	(18)
Mincost Flows	443	(10)
Network Simplex Algorithm	453	(19)
Mincost-Flow Reductions	472	(10)
Perspective	482	(5)
References for Part Five	487	(2)
Index	489

Excerpts

Graphs and graph algorithms are pervasive in modern computing applications. This book describes the most important known methods for solving the graph-processing problems that arise in practice. Its primary aim is to make these methods and the basic principles behind them accessible to the growing number of people in need of knowing them. The material is developed from first principles, starting with basic information and working through classical methods up through modern techniques that are still under development. Carefully chosen examples, detailed figures, and complete implementations supplement thorough descriptions of algorithms and applications. Algorithms This book is the second of three volumes that are intended to survey the most important computer algorithms in use today. The first volume (Parts 1-4) covers fundamental concepts (Part 1), data structures (Part 2), sorting algorithms (Part 3), and searching algorithms (Part 4); this volume (Part 5) covers graphs and graph algorithms; and the (yet to be published) third volume (Parts 6-8) covers strings (Part 6), computational geometry (Part 7), and advanced algorithms and applications (Part 8). The books are useful as texts early in the computer science curriculum, after students have acquired basic programming skills and familiarity with computer systems, but before they have taken specialized courses in advanced areas of computer science or computer applications. The books also are useful for self-study or as a reference for people engaged in the development of computer systems or applications programs because they contain implementations of useful algorithms and detailed information on these algorithms' performance characteristics. The broad perspective taken makes the series an appropriate introduction to the field. Together the three volumes comprise theThird Editionof a book that has been widely used by students and programmers around the world for many years. I have completely rewritten the text for this edition, and I have added thousands of new exercises, hundreds of new figures, dozens of new programs, and detailed commentary on all the figures and programs. This new material provides both coverage of new topics and fuller explanations of many of the classic algorithms. A new emphasis on abstract data types throughout the books makes the programs more broadly useful and relevant in modern object-oriented programming environments. People who have read previous editions will find a wealth of new information throughout; all readers will find a wealth of pedagogical material that provides effective access to essential concepts. These books are not just for programmers and computer-science students. Nearly everyone who uses a computer wants it to run faster or to solve larger problems. The algorithms that we consider represent a body of knowledge developed during the last 50 years that has become indispensable in the efficient use of the computer for a broad variety of applications. From N-body simulation problems in physics to genetic-sequencing problems in molecular biology, the basic methods described here have become essential in scientific research; and from database systems to Internet search engines, they have become essential parts of modern software systems. As the scope of computer applications becomes more widespread, so grows the impact of basic algorithms, particularly the fundamental graph algorithms covered in this volume. The goal of this book is to serve as a resource so that students and professionals can know and make intelligent use of graph algorithms as the need arises in whatever computer application they might undertake. Scope This book,Algorithms in C, Third Edition, Part 5: Graph Algorithms,contains six chapters that cover graph properties and types, graph search, directed graphs, minimal spanning