Screenshot
   
•  Table of Contents


Comments
Algorithms in Java, Part 5: Graph Algorithms
By Robert Sedgewick
  Java ScreenShot
uploader Oracle
Pub Date July 15, 2003
0-201-36121-3
Pages 528
    Screenshot     Screenshot Preface       Screenshot Algorithms       Screenshot Scope       Screenshot Use in the Curriculum       Screenshot Algorithms of Practical Use       Screenshot Programming Language       Screenshot Acknowledgments     Screenshot Java Consultant's Preface     Screenshot Notes on Exercises     Screenshot Part V:  Graph Algorithms       Screenshot   Chapter 17.  Graph Properties and Types       Screenshot Section 17.1.  Glossary       Screenshot Section 17.2.  Graph ADT       Screenshot Section 17.3.  Adjacency-Matrix Representation       Screenshot Section 17.4.  Adjacency-Lists Representation       Screenshot Section 17.5.  Variations, Extensions, and Costs       Screenshot Section 17.6.  Graph Generators       Screenshot Section 17.7.  Simple, Euler, and Hamilton Paths       Screenshot Section 17.8.  Graph-Processing Problems       Screenshot   Chapter 18.  Graph Search       Screenshot Section 18.1.  Exploring a Maze       Screenshot Section 18.2.  Depth-First Search       Screenshot Section 18.3.  Graph-Search ADT Methods       Screenshot Section 18.4.  Properties of DFS Forests       Screenshot Section 18.5.  DFS Algorithms       Screenshot Section 18.6.  Separability and Biconnectivity       Screenshot Section 18.7.  Breadth-First Search       Screenshot Section 18.8.  Generalized Graph Search       Screenshot Section 18.9.  Analysis of Graph Algorithms       Screenshot   Chapter 19.  Digraphs and DAGs       Screenshot Exercises       Screenshot Section 19.1.  Glossary and Rules of the Game       Screenshot Section 19.2.  Anatomy of DFS in Digraphs       Screenshot Section 19.3.  Reachability and Transitive Closure       Screenshot Section 19.4.  Equivalence Relations and Partial Orders       Screenshot Section 19.5.  DAGs       Screenshot Section 19.6.  Topological Sorting       Screenshot Section 19.7.  Reachability in DAGs       Screenshot Section 19.8.  Strong Components in Digraphs       Screenshot Section 19.9.  Transitive Closure Revisited       Screenshot Section 19.10.  Perspective       Screenshot   Chapter 20.  Minimum Spanning Trees       Screenshot Exercises       Screenshot Section 20.1.  Representations       Screenshot Section 20.2.  Underlying Principles of MST Algorithms       Screenshot Section 20.3.  Prim's Algorithm and Priority-First Search       Screenshot Section 20.4.  Kruskal's Algorithm       Screenshot Section 20.5.  Boruvka's Algorithm       Screenshot Section 20.6.  Comparisons and Improvements       Screenshot Section 20.7.  Euclidean MST       Screenshot   Chapter 21.  Shortest Paths       Screenshot Exercises       Screenshot Section 21.1.  Underlying Principles       Screenshot Section 21.2.  Dijkstra's Algorithm       Screenshot Section 21.3.  All-Pairs Shortest Paths       Screenshot Section 21.4.  Shortest Paths in Acyclic Networks       Screenshot Section 21.5.  Euclidean Networks       Screenshot Section 21.6.  Reduction       Screenshot Section 21.7.  Negative Weights       Screenshot Section 21.8.  Perspective       Screenshot   Chapter 22.  Network Flow       Screenshot Section 22.1.  Flow Networks       Screenshot Section 22.2.  Augmenting-Path Maxflow Algorithms       Screenshot Section 22.3.  Preflow-Push Maxflow Algorithms       Screenshot Section 22.4.  Maxflow Reductions       Screenshot Section 22.5.  Mincost Flows       Screenshot Section 22.6.  Network Simplex Algorithm       Screenshot Section 22.7.  Mincost-Flow Reductions       Screenshot Section 22.8.  Perspective     Screenshot  References for Part Five