算法:C语言实现(第5部分)图算法(英文版.3版)

本书是Sedgewick彻底修订和重写的C算法系列的第二本，集中讲解图算法。全书共有6章（第17-22章）。第17章详细讨论图性质和类型，第18-22章分别讲解图搜索、有向图和DAG、最小生成树、最短路径以及网络流。 书中提供了用C语言描述的完整算法源程序，并且配有丰富的插图和练习。作者用简洁的实现将理论和实践成功地结合了起来，这些实现均可在真实应用上测试，使得本书自问世以来备受程序员的欢迎。 本书可作为高等院校计算机相关专业算法与数据结构课程的教材和补充读物，也可供自学使用。

Graph Algorithms Chapter 17 Graph Properties and Types 17.1 Glossary 17.2 Graph ADT 17.3 Adjacency-Matrix Tepressentation 17.4 Adjacency-Lists Tepresentation 17.5 Variations, Extensions, and Costs 17.6 Graph Generators 17.7 Simple, Euler, and Hamilton Paths 17.8 Graph-Processing Problems Chapter 17 Graph Search 18.1 Exploring a Maze 18.2 Depth-First Search 18.3 Graph-Search ADT Functins 18.4 Properties of DFS Forests 18.5 DFS Algorithms 18.6 Separability and Biconnectivity 18.7 Breadth-First Search 18.8 Feneralized Graph Search 18.9 Analysis of Graph Algorithms Chapter 9 Aigraphs and DAGs 19.1 Glossary and ARules of the Game 19.2 Anatomy of DFS in Digraphs 19.3 Readchability and Transitive Closure 19.4 Equivalence Relations and Partial Orders 19.5 DAGs 19.6 Topological Sorting 19.7 Reachability in DAGs 19.8 Strong Components in Digraphs 19.9 Transitive Closure Revisited 19.10 Perspective Chapter 20 Minimum Spanning Trees 20.1 Representations 20.2 Underlying Principles of MST Algorithms 20.3 Prim's Algorithm and Priority-First Search 20.4 KrusKa's Algorithm 20.5 Boruvka's Algorithm 20.6 Comparisons and Improvements 20.7 Euclidean MST Chapter 21 Shortest Paths …… Chapter 22 Network Flows References for Part Five Indes