Algorithms in C · Graph algorithms, Part 5 Upplaga 3

Preface. Notes on Exercises. 17. Graph Properties and Types. Glossary. Graph ADT. Adjacency-Matrix Representation. Adjacency-Lists Representation. Variations, Extensions, and Costs. Graph Generators. Simple, Euler, and Hamilton Paths. Graph-Processing Problems. 18. Graph Search. Exploring a Maze. Depth-First Search. Graph-Search ADT Functions. Properties of DFS Forests. DFS Algorithms. Separability and Biconnectivity. Breadth-First Search. Generalized Graph Search. Analysis of Graph Algorithms. 19. Digraphs and DAGs. Glossary and Rules of the Game. Anatomy of DFS in Digraphs. Reachability and Transitive Closure. Equivalence Relations and Partial Orders. DAGs. Topological Sorting. Reachability in DAGs. Strong Components in Digraphs. Transitive Closure Revisited. Perspective. 20. Minimum Spanning Trees. Representations. Underlying Principles of MST Algorithms. Prim's Algorithm and Priority-First Search. Kruskal's Algorithm. Boruvka's Algorithm. Comparisons and Improvements. Euclidean MST. 21. Shortest Paths. Underlying Principles. Dijkstra's algorithm. All-Pairs Shortest Paths. Shortest Paths in Acyclic Networks. Euclidean Networks. Reduction. Negative Weights. Perspective. 22. Network Flows. Flow Networks. Augmenting-Path Maxflow Algorithms. Preflow-Push Maxflow Algorithms. Maxflow Reductions. Mincost Flows. Network Simplex Algorithm. Mincost-Flow Reductions. Perspective. References for Part Five. Index. 0201316633T09172001