算法V（C++实现）—图算法（第三版 影印版） (2008 年度畅销榜NO.1216 )

本套教学用书的特点：
权威性——教育部高等教育司推荐、教育部高等学校信息科学与技术引进教材专家组遴选
系统性——覆盖计算机专业主干课程和非计算机专业计算机基础课程
先进性——著名计算机专家近两年的最新著作，内容体系先进
经济性——价格与国内自编教材相当、是国内引进教材价格最低的\r\n

Graph Algorithms\r\n\r\nChapter 17. Graph Properties and Types\r\n\r\n17.1 Glossary\r\n17.2 Graph ADT\r\n17.3 Adjacency-Matrix Representation\r\n17.4 Adjacency-Lists Representation\r\n17.5 Variations, Extensions, and Costs\r\n17.6 Graph Generators\r\n17.7 Simple, Euler, and Hamilton Paths\r\n17.8 Graph-Processing Problems\r\n\r\nChapter 18. Graph Search\r\n\r\n18.1 Exploring a Maze\r\n18.2 Depth-First Search\r\n18.3 Graph-Search ADT Functions\r\n18.4 Properties of DFS Forests\r\n18.5 DFS Algorithms\r\n18.6 Separability and Biconnectivity\r\n18.7 Breadth-First Search\r\n18.8 Cenetalized Graph Search\r\n18.9 Analysis of Graph Algorithms\r\n\r\nChapter 19. Digraphs and DAGs\r\n\r\n19.1 Glossary and Rules of the Game\r\n19.2 Anatomy of DFS in Digraphs\r\n19.3 Reachability and Transitive Closure\r\n19.4 Equivalence Relations and Partial Orders\r\n19.5 DAGs\r\n19.6 Topological Sorting\r\n19.7 Reachability in DAGs\r\n19.8 Strong Components in Digraphs\r\n19.9 Transitive Closure Revisited\r\n19.10 Perspective\r\n\r\nChapter 20. Minimum Spanning Trees\r\n\r\n20.1 Representations\r\n20.2 Underlying Principles of MST Algorithms\r\n20.3 Prim's Algotithm and Priority-First Search\r\n20.4 Kruskal's Algorithm\r\n20.5 Boruvka's Algorithm\r\n20.6 Comparisons and Improvements\r\n20.7 Euclidean MST\r\n\r\nChapter 21. Shortest Paths\r\n\r\n21.1 Underlying Principles\r\n21.2 Dijkstra's Algorithm\r\n21.3 AII-Pairs Shortest Paths\r\n21.4 Shortest Paths in Acyclic Networks\r\n21.5 Euclidean Networks\r\n21.6 Reduction\r\n21.7 Negative Weights\r\n21.8 Perspective\r\n\r\nChapter 22. Network Flow\r\n\r\n22.1 Flow Networks\r\n22.2 Augmenting-Path Maxflow Algorithms\r\n22.3 Preflow-Push Maxflow Algorithms\r\n22.4 Maxflow Reductions\r\n22.5 Mincost Flows\r\n22.6 Network Simplex Algorithm\r\n22.7 Mincost-Flow Reductions\r\n22.8 Perspective\r\n\r\nReferences for Part Five\r\n\r\nIndex