3
7.5 有向图强连通分支(dfs/bfs 邻接阵) ....................................................................... 61
7.6 有向图最小点基(邻接阵) ....................................................................................... 62
8、图论—匹配 63
8.1 二分图最大匹配(hungary 邻接表) ......................................................................... 63
8.2 二分图最大匹配(hungary 邻接阵) ......................................................................... 64
8.3 二分图最大匹配(hungary 正向表) ......................................................................... 64
8.4 二分图最佳匹配(kuhn_munkras 邻接阵) ............................................................... 65
8.5 一般图匹配(邻接表) ............................................................................................... 66
8.6 一般图匹配(邻接阵) ............................................................................................... 67
8.7 一般图匹配(正向表) ............................................................................................... 67
9、图论—网络流 68
9.1 最大流(邻接阵) ....................................................................................................... 68
9.2 上下界最大流(邻接阵) ........................................................................................... 69
9.3 上下界最小流(邻接阵) ........................................................................................... 70
9.4 最大流无流量(邻接阵) ........................................................................................... 71
9.5 最小费用最大流(邻接阵) ....................................................................................... 71
10、图论—应用 72
10.1 欧拉回路(邻接阵) ................................................................................................. 72
10.2 树的前序表转化 .................................................................................................... 73
10.3 树的优化算法 ........................................................................................................ 74
10.4 拓扑排序(邻接阵) ................................................................................................. 75
10.5 最佳边割集 ............................................................................................................ 76
10.6 最佳点割集 ............................................................................................................ 77
10.7 最小边割集 ............................................................................................................ 78
10.8 最小点割集 ............................................................................................................ 79
10.9 最小路径覆盖 ........................................................................................................ 81
11、图论—支撑树 81
11.1 最小生成树(kruskal 邻接表)................................................................................. 81
11.2 最小生成树(kruskal 正向表)................................................................................. 83
11.3 最小生成树(prim+binary_heap 邻接表) ............................................................... 84
11.4 最小生成树(prim+binary_heap 正向表) ............................................................... 85
11.5 最小生成树(prim+mapped_heap 邻接表) ............................................................ 86
11.6 最小生成树(prim+mapped_heap 正向表) ............................................................ 88
11.7 最小生成树(prim 邻接阵) ..................................................................................... 89
11.8 最小树形图(邻接阵) ............................................................................................. 89
12、图论—最短路径 91
12.1 最短路径(单源 bellman_ford 邻接阵) .................................................................. 91
12.2 最短路径(单源 dijkstra+bfs 邻接表) .................................................................... 91
12.3 最短路径(单源 dijkstra+bfs 正向表) .................................................................... 92
12.4 最短路径(单源 dijkstra+binary_heap 邻接表) ..................................................... 93
12.5 最短路径(单源 dijkstra+binary_heap 正向表) ..................................................... 94
12.6 最短路径(单源 dijkstra+mapped_heap 邻接表) ................................................... 95
12.7 最短路径(单源 dijkstra+mapped_heap 正向表) ................................................... 96
12.8 最短路径(单源 dijkstra 邻接阵) ........................................................................... 97
