Book description
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. Michael Schidlowsky and Sedgewick have developed concise new Java implementations that both express the methods in a natural and direct manner and also can be used in real applications.
Algorithms in Java, 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. The natural match between Java classes and abstract data type (ADT) implementations makes the code more broadly useful and relevant for the modern object-oriented programming environment.
The Web site for this book (www.cs.princeton.edu/~rs/) provides additional source code for programmers along with a variety of academic support materials for educators.
Coverage includes:
A complete overview of graph properties and types
Diagraphs and DAGs
Minimum spanning trees
Shortest paths
Network flows
Diagrams, sample Java code, and detailed algorithm descriptions
A landmark revision, Algorithms in Java, 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.
Table of contents
- About This eBook
- Title Page
- Copyright Page
- Preface
- Dedication Page
- Notes on Exercises
- Contents
-
Part Five: Graph Algorithms
-
Chapter Seventeen. Graph Properties and Types
- 17.1 Glossary
- Exercises
- 17.2 Graph ADT
- Exercises
- 17.3 Adjacency-Matrix Representation
- Exercises
- 17.4 Adjacency-Lists Representation
- Exercises
- 17.5 Variations, Extensions, and Costs
- Exercises
- 17.6 Graph Generators
- Exercises
- 17.7 Simple, Euler, and Hamilton Paths
- Exercises
- 17.8 Graph-Processing Problems
- Exercises
-
Chapter Eighteen. Graph Search
- 18.1 Exploring a Maze
- Exercises
- 18.2 Depth-First Search
- Exercises
- 18.3 Graph-Search ADT Methods
- Exercises
- 18.4 Properties of DFS Forests
- Exercises
- 18.5 DFS Algorithms
- Exercises
- 18.6 Separability and Biconnectivity
- Exercises
- 18.7 Breadth-First Search
- Exercises
- 18.8 Generalized Graph Search
- Exercises
- 18.9 Analysis of Graph Algorithms
- Exercises
-
Chapter Nineteen. Digraphs and DAGs
- Exercises
- 19.1 Glossary and Rules of the Game
- Exercises
- 19.2 Anatomy of DFS in Digraphs
- Exercises
- 19.3 Reachability and Transitive Closure
- Exercises
- 19.4 Equivalence Relations and Partial Orders
- Exercises
- 19.5 DAGs
- Exercises
- 19.6 Topological Sorting
- Exercises
- 19.7 Reachability in DAGs
- Exercises
- 19.8 Strong Components in Digraphs
- Exercises
- 19.9 Transitive Closure Revisited
- Exercises
- 19.10 Perspective
- Exercises
- Chapter Twenty. Minimum Spanning Trees
- Chapter Twenty-One. Shortest Paths
- Chapter Twenty-Two. Network Flow
-
Chapter Seventeen. Graph Properties and Types
- References for Part Five
- Index
- Code Snippets
Product information
- Title: Algorithms in Java, Third Edition, Part 5: Graph Algorithms
- Author(s):
- Release date: July 2013
- Publisher(s): Addison-Wesley Professional
- ISBN: 0201361213
You might also like
book
Algorithms in Java, Third Edition, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching
Sedgewick has a real gift for explaining concepts in a way that makes them easy to …
book
Java 9 Data Structures and Algorithms
Gain a deep understanding of the complexity of data structures and algorithms and discover the right …
book
Beginning Java Data Structures and Algorithms
Though your application serves its purpose, it might not be a high performer. Learn techniques to …
book
Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching, Third Edition
Robert Sedgewick has thoroughly rewritten and substantially expanded and updated his popular work to provide current …