文件名称:graph
介绍说明－－下载内容均来自于网络，请自行研究使用
图论的算法，最短路，最小生成树，连通，匹配，网络流及应用。-Graph theory, algorithms, shortest path, minimum spanning tree, connectivity, matching, network flow and applications.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
| 文件名 | 大小 | 更新时间 |
|---|---|---|
| graph | ||
| .....\匹配 | ||
| .....\....\一般图匹配(正向表形式).txt | ||
| .....\....\一般图匹配(邻接表形式).txt | ||
| .....\....\一般图匹配(邻接表形式 | 邻接阵接口).txt | |
| .....\....\一般图匹配(邻接阵形式).txt | ||
| .....\....\二分图最佳匹配(kuhn_munkras邻接阵形式).txt | ||
| .....\....\二分图最大匹配(hungary正向表形式).txt | ||
| .....\....\二分图最大匹配(hungary邻接表形式).txt | ||
| .....\....\二分图最大匹配(hungary邻接表形式 | 邻接阵接口).txt | |
| .....\....\二分图最大匹配(hungary邻接阵形式).txt | ||
| .....\....\图论_NP搜索 | ||
| .....\....\...........\最大团(n小于64)(faster).txt | ||
| .....\....\...........\最大团.txt | ||
| .....\应用 | ||
| .....\....\前序表转化.txt | ||
| .....\....\拓扑排序(邻接阵形式).txt | ||
| .....\....\最佳边割集.txt | ||
| .....\....\最佳顶点割集.txt | ||
| .....\....\最小路径覆盖.txt | ||
| .....\....\最小边割集.txt | ||
| .....\....\最小顶点割集.txt | ||
| .....\....\树的优化算法.txt | ||
| .....\....\欧拉回路(邻接阵形式).txt | ||
| .....\最短路径 | ||
| .....\........\最短路径(单源bellman_ford邻接阵形式).txt | ||
| .....\........\最短路径(单源dijkstra+binary_heap正向表形式).txt | ||
| .....\........\最短路径(单源dijkstra+binary_heap邻接表形式).txt | ||
| .....\........\最短路径(单源dijkstra+mapped_heap正向表形式).txt | ||
| .....\........\最短路径(单源dijkstra+mapped_heap邻接表形式).txt | ||
| .....\........\最短路径(单源dijkstra_bfs正向表形式).txt | ||
| .....\........\最短路径(单源dijkstra_bfs邻接表形式).txt | ||
| .....\........\最短路径(单源dijkstra邻接阵形式).txt | ||
| .....\........\最短路径(多源floyd_warshall邻接阵形式).txt | ||
| .....\生成树 | ||
| .....\......\最小树形图(邻接阵形式).txt | ||
| .....\......\最小生成树(kruskal正向表形式).txt | ||
| .....\......\最小生成树(kruskal邻接表形式).txt | ||
| .....\......\最小生成树(prim+binary_heap正向表形式).txt | ||
| .....\......\最小生成树(prim+binary_heap邻接表形式).txt | ||
| .....\......\最小生成树(prim+mapped_heap正向表形式).txt | ||
| .....\......\最小生成树(prim+mapped_heap邻接表形式).txt | ||
| .....\......\最小生成树(prim邻接阵形式).txt | ||
| .....\网络流 | ||
| .....\......\上下界最大流(邻接表形式).txt | ||
| .....\......\上下界最大流(邻接阵形式).txt | ||
| .....\......\上下界最小流(邻接表形式).txt | ||
| .....\......\上下界最小流(邻接阵形式).txt | ||
| .....\......\最大流(邻接表形式).txt | ||
| .....\......\最大流(邻接表形式 | 邻接阵接口).txt | |
| .....\......\最大流(邻接阵形式).txt | ||
| .....\......\最大流无流量(邻接阵形式).txt | ||
| .....\......\最小费用最大流(邻接阵形式).txt | ||
| .....\连通性 | ||
| .....\......\无向图关键点(dfs邻接阵形式).txt | ||
| .....\......\无向图关键边(dfs邻接阵形式).txt | ||
| .....\......\无向图块(bfs邻接阵形式).txt | ||
| .....\......\无向图连通分支(bfs邻接阵形式).txt | ||
| .....\......\无向图连通分支(dfs邻接阵形式).txt | ||
| .....\......\有向图强连通分支(bfs邻接阵形式).txt | ||
| .....\......\有向图强连通分支(dfs邻接阵形式).txt | ||
| .....\......\有向图最小点基(邻接阵形式).txt |