# 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/)