图论总结超强大解读.doc

[ADN.cn][library]summary 图论总结 2019-4-17 1.图论 Graph Theory 1.1.定义与术语 Definition and Glossary 1.1.1.图与网络 Graph and Network 1.1.2.图的术语 Glossary of Graph 1.1.3.路径与回路 Path and Cycle 1.1.4.连通性 Connectivity 1.1.5.图论中特殊的集合 Sets in graph 1.1.6.匹配 Matching 1.1.7.树 Tree 1.1.8.组合优化 Combinatorial optimization 1.2.图的表示 Expressions of graph 1.2.1.邻接矩阵 Adjacency matrix 1.2.2.关联矩阵 Incidence matrix 1.2.3.邻接表 Adjacency list 1.2.4.弧表 Arc list 1.2.5.星形表示 Star 1.3.图的遍历 Traveling in graph 1.3.1.深度优先搜索 Depth first search (DFS) .概念 .求无向连通图中的桥 Finding bridges in undirected graph 1.3.2.广度优先搜索 Breadth first search (BFS) 1.4.拓扑排序 Topological sort 1.5.路径与回路 Paths and circuits 1.5.1.欧拉路径或回路 Eulerian path .无向图 .有向图 .混合图 .无权图 Unweighted .有权图 Weighed — 中国邮路问题The Chinese post problem 1.5.2.Hamiltonian Cycle 哈氏路径与回路 .无权图 Unweighted .有权图 Weighed — 旅行商问题The travelling salesman problem 1.6.网络优化 Network optimization 1.6.1.最小生成树 Minimum spanning trees .基本算法 Basic algorithms .1.Prim .2.Kruskal .3.Sollin（Boruvka） .扩展模型 Extended models .1.度限制生成树 Minimum degree-bounded spanning trees .2.k小生成树 The k minimum spanning tree problem(k-MST) 1.6.2.最短路Shortest paths .单源最短路 Single-source shortest paths .1.基本算法 Basic algorithms 1/33 [ADN.cn][library]summary 图论总结 2019-4-17 .1.1.Dijkstra ..................................................................................................... .1.2.Bellman-Ford .......................................................................................... .1.2.1.Shortest path faster algorithm(SPFA) ................................... ..2.应用Applications .2.1.差分约束系统 System of difference constraints ........................... .2.2.有向无环图上的最短路 Shortest paths in DAG .......................... .所有顶点对间最短路 All-pairs shortest paths .1.基本算法 Basic algorithms .1.1.Floyd-Warshall ....................................................................