數(shù)據與算法

第 1章數(shù)據、數(shù)學模型和算法 ................................................................................ 1
1.1數(shù)據時代 ................................................................................................... 1
1.1.1什么是數(shù)據 ..................................................................................... 1
1.1.2大數(shù)據時代 ..................................................................................... 2
1.1.3數(shù)據的重要性 .................................................................................. 4
1.2數(shù)據的表示 ................................................................................................ 5
1.2.1二元關系及其性質 ........................................................................... 5
1.2.2數(shù)據的邏輯結構 .............................................................................. 9
1.2.3數(shù)據的存儲結構 .............................................................................12
1.2.4抽象數(shù)據類型 .................................................................................12
1.3數(shù)學模型 ..................................................................................................13
1.3.1什么是數(shù)學模型 .............................................................................13
1.3.2數(shù)學模型的種類 .............................................................................14
1.3.3數(shù)學模型與計算機 ..........................................................................15
1.3.4數(shù)據結構 .......................................................................................16
1.4算法及復雜度分析 .....................................................................................16
1.4.1什么是算法 ....................................................................................16
1.4.2問題與解 .......................................................................................17
1.4.3算法的分析與評價 ..........................................................................18
1.5本章小結 ..................................................................................................22
第 2章線性結構...................................................................................................24
2.1線性表 .....................................................................................................24
2.1.1線性表的概念及其抽象數(shù)據類型 ......................................................24
2.1.2線性表的順序存儲——順序表 .........................................................27
2.1.3線性表的鏈式存儲——鏈表 .............................................................30
2.1.4線性表小結 ....................................................................................35
2.2棧 ............................................................................................................35
2.2.1棧的概念與實現(xiàn) .............................................................................35
2.2.2棧的應用 .......................................................................................38
2.2.3遞歸 ..............................................................................................41
2.3隊列 .........................................................................................................48
2.3.1隊列的概念與實現(xiàn) ..........................................................................48
2.3.2優(yōu)先級隊列 ....................................................................................51
2.4字符串 .....................................................................................................55
2.4.1字符串的概念和 ADT ......................................................................55
2.4.2字符串的存儲表示 ..........................................................................56
2.4.3字符串的模式匹配和簡單匹配算法 ...................................................57
2.4.4 KMP算法 .....................................................................................58
2.5本章小結 ..................................................................................................61
第 3章樹與二叉樹 ...............................................................................................62
3.1樹的基本概念 ...........................................................................................62
3.1.1普遍存在的樹結構 ..........................................................................62
3.1.2樹的定義和性質 .............................................................................65
3.2二叉樹 .....................................................................................................67
3.2.1二叉樹的定義和性質 .......................................................................68
3.2.2二叉樹的表示和實現(xiàn) .......................................................................70
3.2.3二叉樹的遍歷 .................................................................................76
3.2.4二叉樹運算 ....................................................................................81
3.2.5二叉樹的建立 .................................................................................83
3.3二叉樹的應用 ...........................................................................................84
3.3.1表達式求值 ....................................................................................84
3.3.2二叉搜索樹 ....................................................................................85
3.3.3 Hu.man樹與編碼 ..........................................................................89
3.3.4堆 .................................................................................................95
3.4并查集 ................................................................................................... 102
3.5本章小結 ................................................................................................ 103
第 4章圖........................................................................................................... 105
4.1圖的基本概念 ......................................................................................... 105
4.1.1圖的定義和概念 ........................................................................... 105
4.1.2圖的抽象數(shù)據類型 ........................................................................ 110
4.1.3歐拉路徑 ..................................................................................... 110
4.2圖的存儲結構 ......................................................................................... 112
4.2.1圖的鄰接矩陣表示 ........................................................................ 112
4.2.2圖的鄰接表表示 ........................................................................... 115
4.2.3圖的其他表示方法 ........................................................................ 119
4.3圖的遍歷 ................................................................................................ 122
4.3.1圖的深度優(yōu)先遍歷 ........................................................................ 123
目錄 IX
4.3.2圖的廣度優(yōu)先遍歷 ........................................................................ 124
4.3.3圖遍歷的應用 ............................................................................... 125
4.3.4圖的連通性 .................................................................................. 128
4.4有向圖與有向無環(huán)圖 ............................................................................... 129
4.4.1有向圖的連通性和傳遞閉包 ........................................................... 129
4.4.2有向無環(huán)圖和拓撲排序 ................................................................. 132
4.4.3關鍵路徑 ..................................................................................... 135
4.5最小生成樹 ............................................................................................. 137
4.5.1圖的生成樹與最小生成樹 .............................................................. 137
4.5.2普里姆 (Prim)算法 ...................................................................... 139
4.5.3克魯斯卡爾 (Kruskal)算法 ............................................................ 142
4.6最短路徑問題 ......................................................................................... 144
4.6.1單源最短路徑 ............................................................................... 145
4.6.2全源最短路徑 ............................................................................... 147
4.7最大流 ................................................................................................... 149
4.7.1網絡流的基本概念 ........................................................................ 150
4.7.2 Ford-Fulkerson方法 ..................................................................... 151
4.8匹配 ....................................................................................................... 154
4.8.1二分圖和匹配的基本概念 .............................................................. 154
4.8.2匈牙利算法 .................................................................................. 155
4.8.3最大匹配與最大流 ........................................................................ 157
4.9本章小結 ................................................................................................ 157