Algorithms in C, Part 5 : Graph Algorithms, 3/e (Paperback)
- 出版商: Addison-Wesley Professional
- 出版日期: 2001-08-26
- 售價: $950
- 貴賓價: 9.5 折 $903
- 語言: 英文
- 頁數: 512
- 裝訂: Paperback
- ISBN: 0201316633
- ISBN-13: 9780201316636
Graph algorithms are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In the third edition, many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. Source code for the implementations is available via the Internet.
Table of Contents
Notes on Exercises.
17. Graph Properties and Types.
Variations, Extensions, and Costs.
Simple, Euler, and Hamilton Paths.
18. Graph Search.
Graph-Search ADT Functions.
Properties of DFS Forests.
Separability and Biconnectivity.
Generalized Graph Search.
Analysis of Graph Algorithms.
19. Digraphs and DAGs.
Anatomy of DFS in Digraphs.
Reachability and Transitive Closure.
Equivalence Relations and Partial Orders.
Reachability in DAGs.
Strong Components in Digraphs.
Transitive Closure Revisited.
20. Minimum Spanning Trees.
Underlying Principles of MST Algorithms.
Prim's Algorithm and Priority-First Search.
Comparisons and Improvements.
21. Shortest Paths.
All-Pairs Shortest Paths.
Shortest Paths in Acyclic Networks.
22. Network Flows.
Augmenting-Path Maxflow Algorithms.
Preflow-Push Maxflow Algorithms.
Network Simplex Algorithm.
References for Part Five.