# Chapter-5 Graph Theory # 第5章 图论  -------- 1. Traverse - 遍历 0. [KnowledgePoint - 知识要点](Traverse/KnowledgePoint/) 1. [PreorderTraverse - 先序遍历](Traverse/PreorderTraverse/) 2. [InorderTraverse - 中序遍历](Traverse/InorderTraverse/) 3. [PostorderTraverse - 后序遍历](Traverse/PostorderTraverse/) 4. [LevelorderTraverse - 层序遍历](Traverse/LevelorderTraverse/) 5. [DepthFirstSearch(DFS) - 深度优先搜索](Traverse/DepthFirstSearch/) 6. [BreadthFirstSearch(BFS) - 广度优先搜索](Traverse/BreadthFirstSearch/) 7. [TopologicalSort - 拓扑排序](Traverse/TopologicalSort/) 8. [EulerCycle - 欧拉回路](Traverse/EulerCycle/) 2. MinimumSpanningTree - 最小生成树 0. [KnowledgePoint - 知识要点](MinimumSpanningTree/KnowledgePoint/) 1. [Kruskal - Kruskal算法](MinimumSpanningTree/Kruskal/) 2. [Prim - Prim算法](MinimumSpanningTree/Prim/) 3. [SecondMinimumSpanningTree - 次小生成树](MinimumSpanningTree/SecondMinimumSpanningTree/) 4. [OptimalRatioSpanningTree - 最优比率生成树](MinimumSpanningTree/OptimalRatioSpanningTree/) 3. ShortestPath - 最短路径 0. [KnowledgePoint - 知识要点](ShortestPath/KnowledgePoint/) 1. [Relaxation - 松弛操作](ShortestPath/Relaxation/) 2. [BellmanFord - BellmanFord算法](ShortestPath/BellmanFord/) 3. [ShortestPathFasterAlgorithm - 最短路径更快算法（SPFA）](ShortestPath/ShortestPathFasterAlgorithm/) 4. [Dijkstra - Dijkstra算法](ShortestPath/Dijkstra/) 5. [Floyd - Floyd算法](ShortestPath/Floyd/) 6. [DifferentConstraints - 差分约束](ShortestPath/DifferentConstraints/) 4. Connectivity - 连通 0. [KnowledgePoint - 知识要点](Connectivity/KnowledgePoint) 1. [Kosaraju - Kosaraju算法](Connectivity/Kosaraju/) 2. [Tarjan - Tarjan算法](Connectivity/Tarjan/) 3. [Gabow - Gabow算法](Connectivity/Gabow/) 4. [TwoSatisfiability - 2-SAT问题](Connectivity/TwoSatisfiability/) 5. [Cut - 割](Connectivity/Cut/) 6. [DoubleConnectedComponent - 双联通分支](Connectivity/DoubleConnectedComponent/) 7. [LeastCommonAncestor - 最近公共祖先](Connectivity/LeastCommonAncestor/) 8. [RangeExtremumQuery - 区域最值查询](Connectivity/RangeExtremumQuery/) 5. FlowNetwork - 网络流 1. [EdmondsKarp - EdmondsKarp算法](FlowNetwork/EdmondsKarp/) 2. [PushAndRelabel - 压入与重标记](FlowNetwork/PushAndRelabel/) 3. [Dinic - Dinic算法](FlowNetwork/Dinic/) 4. [DistanceLabel - 距离标号算法](FlowNetwork/DistanceLabel/) 5. [RelabelToFront - 重标记与前移算法](FlowNetwork/RelabelToFront/) 6. [HighestLabelPreflowPush - 最高标号预留与推进算法](FlowNetwork/HighestLabelPreflowPush/) 7. [DistanceLabel_AdjacentListVersion - 距离标号算法-邻接表优化版](FlowNetwork/DistanceLabel_AdjacentListVersion/) 8. [Summary-Maxflow - 最大流算法小结](FlowNetwork/Summary-Maxflow/) 9. [MinimumCost_Maxflow - 最小费用最大流](FlowNetwork/MinimumCost_Maxflow/) 10. [MultipleSourceMultipleSink_Maxflow - 多源点、多汇点最大流](FlowNetwork/MultipleSourceMultipleSink_Maxflow/) 11. [Connectivity - 连通度](FlowNetwork/Connectivity/) 12. [NoSourceNoSink_VolumeBounded_Flow - 无源点、无汇点、容量有上下界的流网络](FlowNetwork/NoSourceNoSink_VolumeBounded_Flow/) 13. [VolumeBounded_Maxflow - 容量有上下界的最大流](FlowNetwork/VolumeBounded_Maxflow/) 14. [VolumeBounded_Minflow - 容量有上下界的最小流](FlowNetwork/VolumeBounded_Minflow/) 6. BinaryMatch - 二分匹配 1. [Hungarian - 匈牙利算法](BinaryMatch/Hungarian/) 2. [HopcroftKarp - Hopcroft-Karp算法](BinaryMatch/HopcroftKarp/) 3. [MatchToMaxflow - 二分匹配转化为最大流](BinaryMatch/MatchToMaxflow/) 4. [KuhnMunkres - Kuhn-Munkres算法](BinaryMatch/KuhnMunkres/) 5. [Introduction-Domination_Independent_Covering_Clique - 支配集、独立集、覆盖集、团的介绍](BinaryMatch/Introduction-Domination_Independent_Covering_Clique/) 6. [WeightedCoveringAndIndependentSet - 最小点权覆盖和最大点权独立集](BinaryMatch/WeightedCoveringAndIndependentSet/) 7. [MinimumDisjointPathCovering - 最小不相交路径覆盖](BinaryMatch/MinimumDisjointPathCovering/) 8. [MinimumJointPathCovering - 最小可相交路径覆盖](BinaryMatch/MinimumJointPathCovering/) 9. [Coloring - 染色问题](BinaryMatch/Coloring/)