Content 目录 · 算法之路 - Way to Algorithm

# Content - 目录 * [Content 目录](SUMMARY.md) * [Preface 前言](docs/Preface/README.md) * [Chapter-1 Sort 第1章排序](docs/Sort/README.md) * [InsertSort 插入排序](docs/Sort/InsertSort/README.md) * [BubbleSort 冒泡排序](docs/Sort/BubbleSort/README.md) * [QuickSort 快速排序](docs/Sort/QuickSort/README.md) * [MergeSort 归并排序](docs/Sort/MergeSort/README.md) * [Chapter-2 Search 第2章搜索](docs/Search/README.md) * [BinarySearch 二分查找法（折半查找法）](docs/Search/BinarySearch/README.md) * [BruteForce 暴力枚举](docs/Search/BruteForce/README.md) * [Recursion 递归](docs/Search/Recursion/README.md) * [BreadthFirstSearch 广度优先搜索](docs/Search/BreadthFirstSearch/README.md) * [BidirectionalBreadthSearch 双向广度搜索](docs/Search/BidirectionalBreadthSearch/README.md) * [AStarSearch A\*搜索](docs/Search/AStarSearch/README.md) * [DancingLink 舞蹈链](docs/Search/DancingLink/README.md) * [Chapter-3 DataStructure 第3章数据结构](docs/DataStructure/README.md) * [DisjointSet 并查集](docs/DataStructure/DisjointSet/README.md) * [PrefixTree(TrieTree) 前缀树](docs/DataStructure/PrefixTree/README.md) * [LeftistTree(LeftistHeap) 左偏树（左偏堆）](docs/DataStructure/LeftistTree/README.md) * [SegmentTree 线段树](docs/DataStructure/SegmentTree/README.md) * [FenwickTree(BinaryIndexedTree) 树状数组](docs/DataStructure/FenwickTree/README.md) * [BinarySearchTree 二叉查找树](docs/DataStructure/BinarySearchTree/README.md) * [AVLTree AVL平衡树](docs/DataStructure/AVLTree/README.md) * [RedBlackTree 红黑树](docs/DataStructure/RedBlackTree/README.md) * [Chapter-4 DynamicProgramming 第4章动态规划](docs/DynamicProgramming/README.md) * Section-1 LinearDP 第1节线性动规 * [LongestCommonSubsequence 最长公共子序列](docs/DynamicProgramming/LinearDP/LongestCommonSubsequence/README.md) * [LongestIncreasingSubsequence 最长递增子序列](docs/DynamicProgramming/LinearDP/LongestIncreasingSubsequence/README.md) * [LongestIncreasingSubsequenceExtension 最长递增子序列扩展](docs/DynamicProgramming/LinearDP/LongestIncreasingSubsequenceExtension/README.md) * [BidirectionalSubsequence 双向子序列](docs/DynamicProgramming/LinearDP/BidirectionalSubsequence/README.md) * Section-2 BagDP 第2节背包问题 * [ZeroOneBag 01背包](docs/DynamicProgramming/BagDP/ZeroOneBag/README.md) * [CompleteBag 完全背包](docs/DynamicProgramming/BagDP/CompleteBag/README.md) * [TwoDimensionBag 二维背包](docs/DynamicProgramming/BagDP/TwoDimensionBag/README.md) * [GroupBag 分组背包](docs/DynamicProgramming/BagDP/GroupBag/README.md) * Section-3 RegionalDP 第3节区域动规 * [MinimumMergeCost - 最小合并代价](docs/DynamicProgramming/RegionalDP/MinimumMergeCost/README.md) * [MinimumMergeCostExtension - 最小合并代价扩展](docs/DynamicProgramming/RegionalDP/MinimumMergeCostExtension/README.md) * [MaximumBinaryTreeMerge - 最大二叉树合并](docs/DynamicProgramming/RegionalDP/MaximumBinaryTreeMerge/README.md) * Section-4 TreeDP 第4节树形动规 * [BinaryTreeDP 二叉树动规](docs/DynamicProgramming/TreeDP/BinaryTreeDP/README.md) * [MultipleTreeDP 多叉树动规](docs/DynamicProgramming/TreeDP/MultipleTreeDP/README.md) * [MultipleTreeDPExtension 多叉树动规扩展](docs/DynamicProgramming/TreeDP/MultipleTreeDPExtension/README.md) * [LoopedMultipleTreeDP 带环多叉树动规](docs/DynamicProgramming/TreeDP/LoopedMultipleTreeDP/README.md) * [TraverseBinaryTreeDP 遍历二叉树动规](docs/DynamicProgramming/TreeDP/TraverseBinaryTreeDP/README.md) * [Chapter-5 GraphTheory 第5章图论](docs/GraphTheory/README.md) * Section-1 Traverse 第1节遍历 * [PreorderTraverse 先序遍历](docs/GraphTheory/Traverse/PreorderTraverse/README.md) * [InorderTraverse 中序遍历](docs/GraphTheory/Traverse/InorderTraverse/README.md) * [PostorderTraverse 后序遍历](docs/GraphTheory/Traverse/PostorderTraverse/README.md) * [LevelorderTraverse 层序遍历](docs/GraphTheory/Traverse/LevelorderTraverse/README.md) * [DepthFirstSearch 深度优先搜索](docs/GraphTheory/Traverse/DepthFirstSearch/README.md) * [BreadthFirstSearch 广度优先搜索](docs/GraphTheory/Traverse/BreadthFirstSearch/README.md) * [TopologicalSort 拓扑排序](docs/GraphTheory/Traverse/TopologicalSort/README.md) * [EulerCycle 欧拉回路](docs/GraphTheory/Traverse/EulerCycle/README.md) * Section-2 MinimumSpanningTree 第2节最小生成树 * [Kruskal Kruskal算法](docs/GraphTheory/MinimumSpanningTree/Kruskal/README.md) * [Prim Prim算法](docs/GraphTheory/MinimumSpanningTree/Prim/README.md) * [SecondMinimumSpanningTree 次小生成树](docs/GraphTheory/MinimumSpanningTree/SecondMinimumSpanningTree/README.md) * [OptimalRatioSpanningTree 最优比率生成树](docs/GraphTheory/MinimumSpanningTree/OptimalRatioSpanningTree/README.md) * Section-3 ShortestPath 第3节最短路径 * [Relaxation 松弛操作](docs/GraphTheory/ShortestPath/Relaxation/README.md) * [BellmanFord BellmanFord算法](docs/GraphTheory/ShortestPath/BellmanFord/README.md) * [ShortestPathFasterAlgorithm 最短路径更快算法（SPFA）](docs/GraphTheory/ShortestPath/ShortestPathFasterAlgorithm/README.md) * [Dijkstra Dijkstra算法](docs/GraphTheory/ShortestPath/Dijkstra/README.md) * [Floyd Floyd算法](docs/GraphTheory/ShortestPath/Floyd/README.md) * [DifferentConstraints 差分约束](docs/GraphTheory/ShortestPath/DifferentConstraints/README.md) * Section-4 Connectivity 第4节连通 * [Kosaraju Kosaraju算法](docs/GraphTheory/Connectivity/Kosaraju/README.md) * [Tarjan Tarjan算法](docs/GraphTheory/Connectivity/Tarjan/README.md) * [Gabow - Gabow算法](docs/GraphTheory/Connectivity/Gabow/README.md) * [TwoSatisfiability 2-SAT问题](docs/GraphTheory/Connectivity/TwoSatisfiability/README.md) * [Cut 割](docs/GraphTheory/Connectivity/Cut/README.md) * [DoubleConnectedComponent 双联通分支](docs/GraphTheory/Connectivity/DoubleConnectedComponent/README.md) * [LeastCommonAncestor 最近公共祖先](docs/GraphTheory/Connectivity/LeastCommonAncestor/README.md) * [RangeExtremumQuery 区域最值查询](docs/GraphTheory/Connectivity/RangeExtremumQuery/README.md) * Section-5 FlowNetwork 第5节网络流 * [EdmondsKarp EdmondsKarp算法](docs/GraphTheory/FlowNetwork/EdmondsKarp/README.md) * [PushAndRelabel 压入与重标记](docs/GraphTheory/FlowNetwork/PushAndRelabel/README.md) * [Dinic Dinic算法](docs/GraphTheory/FlowNetwork/Dinic/README.md) * [DistanceLabel 距离标号算法](docs/GraphTheory/FlowNetwork/DistanceLabel/README.md) * [RelabelToFront 重标记与前移算法](docs/GraphTheory/FlowNetwork/RelabelToFront/README.md) * [HighestLabelPreflowPush 最高标号预留与推进算法](docs/GraphTheory/FlowNetwork/HighestLabelPreflowPush/README.md) * [DistanceLabel-AdjacentListVersion 距离标号算法-邻接表优化版](docs/GraphTheory/FlowNetwork/DistanceLabel-AdjacentListVersion/README.md) * [Summary-Maxflow 最大流算法小结](docs/GraphTheory/FlowNetwork/Summary-Maxflow/README.md) * [MinimumCost-Maxflow 最小费用最大流](docs/GraphTheory/FlowNetwork/MinimumCost-Maxflow/README.md) * [MultipleSourceMultipleSink-Maxflow 多源点、多汇点的最大流](docs/GraphTheory/FlowNetwork/MultipleSourceMultipleSink-Maxflow/README.md) * [Connectivity 连通度](docs/GraphTheory/FlowNetwork/Connectivity/README.md) * [NoSourceNoSink-VolumeBoundedFlow 无源点、无汇点、容量有上下界的流网络](docs/GraphTheory/FlowNetwork/NoSourceNoSink-VolumeBoundedFlow/README.md) * [VolumeBounded-Maxflow 容量有上下界的最大流](docs/GraphTheory/FlowNetwork/VolumeBounded-Maxflow/README.md) * [VolumeBounded-Minflow 容量有上下界的最小流](docs/GraphTheory/FlowNetwork/VolumeBounded-Minflow/README.md) * Section-6 BinaryMatch 第6节二分匹配 * [Hungarian 匈牙利算法](docs/GraphTheory/BinaryMatch/Hungarian/README.md) * [HopcroftKarp Hopcroft-Karp算法](docs/GraphTheory/BinaryMatch/HopcroftKarp/README.md) * [MatchToMaxflow 二分匹配转化为最大流](docs/GraphTheory/BinaryMatch/MatchToMaxflow/README.md) * [KuhnMunkres Kuhn-Munkres算法](docs/GraphTheory/BinaryMatch/KuhnMunkres/README.md) * [Introduction-Domination,Independent,Covering,Clique 介绍支配集、独立集、覆盖集和团](docs/GraphTheory/BinaryMatch/Introduction-Domination_Independent_Covering_Clique/README.md) * [WeightedCoveringAndIndependentSet 最小点权覆盖和最大点权独立集](docs/GraphTheory/BinaryMatch/WeightedCoveringAndIndependentSet/README.md) * [MinimumDisjointPathCovering 最小不相交路径覆盖](docs/GraphTheory/BinaryMatch/MinimumDisjointPathCovering/README.md) * [MinimumJointPathCovering 最小可相交路径覆盖](docs/GraphTheory/BinaryMatch/MinimumJointPathCovering/README.md) * [Coloring 染色问题](docs/GraphTheory/BinaryMatch/Coloring/README.md) * [Chapter-6 Calculation 第6章计算](docs/Calculation/README.md) * [LargeNumber 大数字](docs/Calculation/LargeNumber/README.md) * [Exponentiation 求幂运算](docs/Calculation/Exponentiation/README.md) * [Chapter-7 CombinatorialMathematics 第7章组合数学](docs/CombinatorialMathematics/README.md) * [FullPermutation 全排列](docs/CombinatorialMathematics/FullPermutation/README.md) * [UniqueFullPermutation 唯一的全排列](docs/CombinatorialMathematics/UniqueFullPermutation/README.md) * [Combination 组合](docs/CombinatorialMathematics/Combination/README.md) * [DuplicableCombination （元素）可重复的组合](docs/CombinatorialMathematics/DuplicableCombination/README.md) * [Subset 子集](docs/CombinatorialMathematics/Subset/README.md) * [UniqueSubset 唯一的子集](docs/CombinatorialMathematics/UniqueSubset/README.md) * [Permutation 排列](docs/CombinatorialMathematics/Permutation/README.md) * [PermutationGroup 置换群](docs/CombinatorialMathematics/PermutationGroup/README.md) * [Catalan 卡特兰数](docs/CombinatorialMathematics/Catalan/README.md) * [Chapter-8 NumberTheory 第8章数论](docs/NumberTheory/README.md) * [Sieve 筛选算法](docs/NumberTheory/Sieve/README.md) * [Euclid 欧几里得](docs/NumberTheory/Euclid/README.md) * [EuclidExtension 欧几里得扩展](docs/NumberTheory/EuclidExtension/README.md) * [ModularLinearEquation 模线性方程](docs/NumberTheory/ModularLinearEquation/README.md) * [ChineseRemainerTheorem 中国剩余定理](docs/NumberTheory/ChineseRemainerTheorem/README.md) * [ModularExponentiation 模幂运算](docs/NumberTheory/ModularExponentiation/README.md) * [Chapter-9 LinearAlgebra 第9章线性代数](docs/LinearAlgebra/README.md) * Section-1 Matrix 第1节矩阵 * [Strassen Strassen算法](docs/LinearAlgebra/Matrix/Strassen/README.md) * [GaussElimination 高斯消元法](docs/LinearAlgebra/Matrix/GaussElimination/README.md) * [LUP LUP分解](docs/LinearAlgebra/Matrix/LUP/README.md) * [InverseMatrix 矩阵求逆](docs/LinearAlgebra/Matrix/InverseMatrix/README.md) * Section-2 LinearProgramming 第2节线性规划 * [Simplex 单纯形算法](docs/LinearAlgebra/LinearProgramming/Simplex/README.md) * [Dinkelback Dinkelback算法](docs/LinearAlgebra/LinearProgramming/Dinkelback/README.md) * [Chapter-10 AnalyticGeometry 第10章解析几何](docs/AnalyticGeometry/README.md) * Section-1 Polygon 第1节多边形 * [Cross 叉积](docs/AnalyticGeometry/Polygon/Cross/README.md) * [SegmentIntersection 线段相交](docs/AnalyticGeometry/Polygon/SegmentIntersection/README.md) * [Sweeping 扫除算法](docs/AnalyticGeometry/Polygon/Sweeping/README.md) * [ConvexPolygonArea 凸多边形面积](docs/AnalyticGeometry/Polygon/ConvexPolygonArea/README.md) * [ConvexPolygonGravityCenter 凸多边形重心](docs/AnalyticGeometry/Polygon/ConvexPolygonGravityCenter/README.md) * [RayDistinguish 射线判别](docs/AnalyticGeometry/Polygon/RayDistinguish/README.md) * [RotatingCalipers 旋转卡壳](docs/AnalyticGeometry/Polygon/RotatingCalipers/README.md) * Section-2 ConvexHull 第2节凸包 * [NearestNeighbor 最近点对](docs/AnalyticGeometry/ConvexHull/NearestNeighbor/README.md) * [GrahamScan Graham扫描算法](docs/AnalyticGeometry/ConvexHull/GrahamScan/README.md) * [QuickConvexHull 快速凸包算法](docs/AnalyticGeometry/ConvexHull/QuickConvexHull/README.md) * [Chapter-11 TextMatch 第11章文本匹配](docs/TextMatch/README.md) * [SimpleMatch 简单匹配](docs/TextMatch/SimpleMatch/README.md) * [AhoCorasickAutomata AC自动机](docs/TextMatch/AhoCorasickAutomata/README.md) * [KnuthMorrisPratt KMP匹配算法](docs/TextMatch/KnuthMorrisPratt/README.md) * [RabinKarp RabinKarp算法](docs/TextMatch/RabinKarp/README.md) * [BoyerMoore BoyerMoore算法](docs/TextMatch/BoyerMoore/README.md) * [Chapter-12 GameTheory 第12章博弈论](docs/GameTheory/README.md) * [BashGame 巴什博弈](docs/GameTheory/BashGame/README.md) * [WythoffGame 威佐夫博弈](docs/GameTheory/WythoffGame/README.md) * [NimGame 尼姆博弈](docs/GameTheory/NimGame/README.md)