Chapter 17. Graph Properties and Types
17.3 Adjacency-Matrix Representation
17.4 Adjacency-Lists Representation
17.5 Variations, Extensions, and Costs
17.7 Simple, Euler, and Hamilton Paths
17.8 Graph-Processing Problems
18.3 Graph-Search ADT Functions
18.4 Properties of DFS Forests
18.6 Separability and Biconnectivity
18.9 Analysis of Graph Algorithms
19.1 Glossary and Rules of the Game
19.2 Anatomy of DFS in Digraphs
19.3 Reachability and Transitive Closure
19.4 Equivalence Relations and Partial Orders
19.8 Strong Components in Digraphs
19.9 Transitive Closure Revisited
Chapter 20. Minimum Spanning Trees
20.2 Underlying Principles of MST Algorithms
20.3 Prim’s Algorithm and Priority-First Search
20.6 Comparisons and Improvements
21.4 Shortest Paths in Acyclic Networks
22.2 Augmenting-Path Maxflow Algorithms
22.3 Preflow-Push Maxflow Algorithms
3.139.97.53