目录 III
6.1.3 图的基本操作...................................................................................................165
6.2 图的存储结构...............................................................................................................166
6.2.1 邻接矩阵............................................................................................................167
6.2.2 邻接表...............................................................................................................172
6.3 图的遍历.......................................................................................................................185
6.3.1 深度优先遍历...................................................................................................185
6.3.2 广度优先遍历...................................................................................................188
6.4 图的应用.......................................................................................................................189
6.4.1 最小生成树.......................................................................................................189
6.4.2 最短路径...........................................................................................................199
6.4.3 拓扑排序...........................................................................................................207
本章小结...............................................................................................................................210
习题六...................................................................................................................................210
第7章 排序.......................................................................................................................213
7.1 基本概念.......................................................................................................................213
7.2 简单排序方法...............................................................................................................214
7.2.1 直接插入排序...................................................................................................214
7.2.2 冒泡排序...........................................................................................................216
7.2.3 简单选择排序...................................................................................................217
7.3 快速排序.......................................................................................................................219
7.4 堆排序...........................................................................................................................222
7.5 归并排序.......................................................................................................................230
7.6 基数排序.......................................................................................................................232
7.6.1 多关键码排序...................................................................................................232
7.6.2 链式基数排序...................................................................................................233
7.7 各种排序方法的比较与讨论.......................................................................................235
7.8 C#中排序方法...............................................................................................................235
本章小结...............................................................................................................................236
习题七...................................................................................................................................236
第8章 查找.......................................................................................................................238
8.1 基本概念和术语............................................................................................................238
8.2 静态查找表...................................................................................................................238
8.2.1 顺序查找...........................................................................................................238
8.2.2 有序表的折半查找...........................................................................................239
8.2.3 索引查找...........................................................................................................242
8.3 动态查找表...................................................................................................................243
8.4 哈希表...........................................................................................................................252
8.4.1 哈希表的基本概念...........................................................................................252
8.4.2 常用的哈希函数构造方法...............................................................................253
8.4.3 处理冲突的方法...............................................................................................254
8.5 C#中的查找方法...........................................................................................................256
本章小结...............................................................................................................................256
习题八...................................................................................................................................256
参考文献.......................................................................................................................................257
数据结构（C#语言版）
