| |
| 《ALGORITHMS IN C++,PART 5 Graph Algorithms算法V(C++实现)—图算法(第三版影印版)》 | |
| |
| |
内容简介
本套教学用书的特点：
权威性——教育部高等教育司推荐、教育部高等学校信息科学与技术引进教材专家组遴选
系统性——覆盖计算机专业主干课程和非计算机专业计算机基础课程
先进性——著名计算机专家近两年的最新著作，内容体系先进
经济性——价格与国内自编教材相当、是国内引进教材价格最低的
This book is the second of three volumes that are intended to survey the most important computer algorithms in use today. The first volume (Parts 1-4) covers fundamental concepts (Part 1 ), data structures (Part 2), sorting algorithms (Part 3), and searching algorithms (Part 4); this volume (Part 5) covers graphs and graph algorithms; and the (yet to be published) third volume (Parts 6-8) covers strings (Part 6), computational geometry (Part 7), and advanced algorithms and applications (Part 8).
| |
|
顾客评论
|
|
目录
内容：⒘ 图表性质与类型 ⒙ 图表的搜索 ⒚ 有向图与有向非循环图 ⒛ 最小生成树 21. 最短路径 22. 网络流
Chapter 17 Graph Properties and Types
17.1 Glossary
17.2 Graph ADT
17.3 Adjacency-Matrix Representation
17.4 Adjacency-Lists Representation
17.5 Variations, Extensions, and Costs
17.6 Graph Generators
17.7 Simple, Euler, and Hamilton Paths
17.8 Graph-Processing Problems
Chapter 18 Graph Search
18.1 Exploring a Maze
18.2 Depth-First Search
18.3 Graph-Search ADT Functions
18.4 Properties of DFS Forests
18.5 DFS Algorithms
18.6 Separability and Biconnectivity
18.7 Breadth-First Search
18.8 Generalized Graph Search
18.9 Analysis of Graph Algorithms
Chapter 19 Digraphs and DAGs
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.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 Kruskal''''s Algorithm
20.5 Boruvka''''s Algorithm
20.6 Comparisons and Improvements
20.7 Euclidean MST
Chapter 21 Shortest Paths
21.1 Underlying Principles
21.2 Dijkstra''''s Algorithm
21.3 All-Pairs Shortest Paths
21.4 Shortest Paths in Acyclic Networks
21.5 Euclidean Networks
21.6 Reduction
21.7 Negative Weights
21.8 Perspective
Chapter 22 Network Flow
22.1 Flow Networks
22.2 Augmenting-Path Maxflow Algorithms
22.3 Preflow-Push Maxflow Algorithms
22.4 Maxflow Reductions
22.5 Mincost Flows
22.6 Network Simplex Algorithm
22.7 Mincost-Flow Reductions
22.8 Perspective
References for Part Five
Index
| |
ALGORITHMS IN C++,PART 5 Graph Algorithms算法V(C++实现)—图算法(第三版影印版)-相关图书
·店铺销售管理
·SOFTWARE PROJECT MANAGEMENT A
·NLP简快心理疗法
·离散数学提要及习题解答
·新编税务处理与核算手册
·奥运赞助谋略
·拟阵论
·实验室生物安全手册
·建筑大师莱特
·地理信息系统二次开发实例教程——C++Builder和Map
·ASP游戏编程导学
·大学问：最令人惊叹的做人与用人绝道
·河流动力学
·调皮的计时器:讲述时间的简史
·Windows CE.NET系统分析及实验教程
·新编商务信函写作模式
·智慧禅
·佛道人生
·老人与海
·峨眉山 我注定逃不出你的多情
|
| |
