# Way-to-Algorithm

**Repository Path**: dirklu/Way-to-Algorithm

## Basic Information

- **Project Name**: Way-to-Algorithm
- **Description**: Computer Basic Algorithm Tutorial and Source Code - 计算机基础算法教程与源码
- **Primary Language**: Unknown
- **License**: MIT
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2017-02-10
- **Last Updated**: 2020-12-19

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

##
-----------------
## <p align="center">Way to Algorithm - 算法之路</p>
<p align="center"><img src="https://github.com/zhaochenyou/Way-to-Algorithm/raw/master/keyboard.jpg" /></p>
<p align="center">Computer Basic Algorithm Tutorial and Source Code - 计算机基础算法教程与源码</p>

####
-----------------
#### <p>Content - 目录结构</p>
* Chapter-1 - Sort &nbsp; 排序<br/> 
    * InsertSort &nbsp; 插入排序<br/> 
    * BubbleSort &nbsp; 冒泡排序<br/> 
    * QuickSort &nbsp; 快速排序<br/> 
    * MergeSort &nbsp; 合并排序<br/>
* Chapter-2 - Search &nbsp; 搜索<br/> 
    * BinarySearch &nbsp; 二分查找法<br/> 
    * BruteForce &nbsp; 暴力枚举<br/> 
    * Resursion &nbsp; 递归<br/> 
    * BreadthFirstSearch &nbsp; 广度优先搜索<br/> 
    * BidirectionalBreadthSearch &nbsp; 双向优先搜索<br/> 
    * AStarSearch &nbsp; A*搜索<br/> 
    * DancingLinks &nbsp; 舞蹈链<br/>
    * Introduction-AdvancedSearch &nbsp; 高级搜索介绍<br/>
* Chapter-3 - DataStructure &nbsp; 数据结构<br/> 
    * Introduction-ClassicDataStructure &nbsp; 经典数据结构介绍<br/> 
    * HashTable &nbsp; 哈希表<br/> 
    * DisjointSet &nbsp; 并查集<br/> 
    * BinaryIndexTree &nbsp; 树状数组<br/> 
    * SegmentTree &nbsp; 线段树<br/> 
    * LeftistTree &nbsp; 左偏树<br/> 
    * PrefixTree &nbsp; 前缀树<br/> 
    * SuffixTree &nbsp; 后缀树<br/> 
    * AVLTree &nbsp; 平衡二叉树<br/> 
    * RedBlackTree &nbsp; 红黑树<br/>
* Chapter-4 - DynamicProgramming &nbsp; 动态规划<br/> 
    * Introduction-DynamicProgramming &nbsp; 动态规划介绍<br/> 
    * LinearDP &nbsp; 线性动态规划<br/> 
        * LongestCommonSubsequence &nbsp; 最长公共子序列<br/> 
        * LongestIncreasingSubsequence &nbsp; 最长递增子序列<br/> 
        * LongestIncreasingSubsequenceExtension &nbsp; 最长递增子序列扩展<br/> 
        * BidirectionSubsequence &nbsp; 双向子序列<br/> 
    * KnapsackDP &nbsp; 背包问题<br/> 
        * ZeroOneKnapsack &nbsp; 01背包<br/> 
        * ZeroOneKnapsackExtension &nbsp; 01背包扩展<br/> 
        * CompleteKnapsack &nbsp; 完全背包<br/> 
        * TwoDimensionKnapsack &nbsp; 二维背包<br/> 
        * GroupKnapsack &nbsp; 分组背包<br/> 
    * RegionDynamic &nbsp; 区域动态规划<br/> 
        * MinimumMergeCost &nbsp; 最小合并代价<br/> 
        * MinimumMergeExtension &nbsp; 最小合并扩展<br/> 
        * MaximumBinaryTreeMerge &nbsp; 最大二叉树合并<br/> 
    * TreeDynamic &nbsp; 树形动态规划<br/> 
        * BinaryTree &nbsp; 二叉树<br/> 
        * MultipleTree &nbsp; 多叉树<br/> 
        * Multiple2BinaryTree &nbsp; 多叉树转二叉树<br/> 
        * MultipleTreePath &nbsp; 多叉树路径<br/> 
        * LoopedMultipleTree &nbsp; 带环多叉树<br/> 
        * MultipleTreeTraverse &nbsp; 多叉树遍历<br/>
* Chapter-5 - GraphTheory &nbsp; 图论<br/>
    * Traverse &nbsp; 遍历<br/>
        * TraverseTree &nbsp; 遍历树<br/>
        * DepthFirstSearch &nbsp; 深度优先遍历<br/>
        * BreadthFirstSearch &nbsp; 广度优先遍历<br/>
        * TopologicalSort &nbsp; 拓扑排序<br/>
        * EulerLoop &nbsp; 欧拉回路<br/>
        * HamiltonLoop &nbsp; 汉密尔顿回路<br/>
        * Kosaraju &nbsp; Kosaraju算法<br/>
        * 2-Satisfiability &nbsp; 2-SAT问题<br/>
    * Tarjan &nbsp; Tarjan算法<br/>
        * StrongestConnectedComponent &nbsp; 强连通分支<br/>
        * Gabow &nbsp; Gabow算法<br/>
        * Cut &nbsp; 割<br/>
        * DoubleConnectedComponent &nbsp; 双连通分支<br/>
        * LeastCommonAncestor &nbsp; 最近公共祖先<br/>
        * RangeExtremumQuery &nbsp; 区域最值查询<br/>
    * MinimumSpanningTree &nbsp; 最小生成树<br/>
        * Kruskal &nbsp; Kruskal算法<br/>
        * Prim &nbsp; Prim算法<br/>
        * SecondMinimumSpanningTree &nbsp; 次小生成树<br/>
        * DegreeBoundedSpanningTree &nbsp; 度限制生成树<br/>
        * OptimalRatioSpanningTree &nbsp; 最优比率生成树<br/>
    * ShortestPath &nbsp; 最短路径<br/>
        * Relaxation &nbsp; 松弛操作<br/>
        * BellmanFord &nbsp; BellmanFord算法<br/>
        * ShortestPathFasterAlgorithm &nbsp; SPFA最短路径更快算法<br/>
        * Dijkstra &nbsp; Dijkstra算法<br/>
        * Floyd &nbsp; Floyd算法<br/>
        * DifferentConstraints &nbsp; 差分约束<br/>
    * FlowNetwork &nbsp; 网络流<br/>
        * EdmondsKarp &nbsp; EdmondsKarp算法<br/>
        * PushAndRelabel &nbsp; 压入与重标记<br/>
        * Dinic &nbsp; Dinic算法<br/>
        * DistanceLabel &nbsp; 距离标号算法<br/>
        * RelabelToFront &nbsp; 重标记与前移算法<br/>
        * HighestLabelPreflowPush &nbsp; 最高标号预留与推进算法<br/>
        * DistanceLabel_AdjacentListVersion &nbsp; 距离标号算法_邻接表优化版<br/>
        * DistanceLabel_AdjacentListVersion &nbsp; 距离标号算法_邻接表优化版<br/>
        * Summary-Maxflow &nbsp; 最大流算法小结<br/>
        * MinimumCost_Maxflow &nbsp; 最小费用最大流<br/>
        * MultipleSourceSink_Maxflow &nbsp; 多源点、多汇点最大流<br/>
        * Connectivity &nbsp; 连通度<br/>
        * NoSource_NoSink_VolumeBounded_Flow &nbsp; 无源点、无汇点、容量有上下界的流网络<br/>
        * VolumeBounded_Maxflow &nbsp; 容量有上下界的最大流<br/>
        * VolumeBounded_Minflow &nbsp; 容量有上下界的最小流<br/>
    * BinaryMatch &nbsp; 二分匹配<br/>
        * Hungarian &nbsp; 匈牙利算法<br/>
        * HopcroftKarp &nbsp; Hopcroft-Karp算法<br/>
        * Match2Maxflow &nbsp; 二分匹配转最大流<br/>
        * KuhnMunkres &nbsp; Kuhn-Munkres算法<br/>
        * Introduction-Domination_Independent_Covering_Clique &nbsp; 支配集，独立集，覆盖集与团的介绍<br/>
        * WeightedCoveringAndIndependentSet &nbsp; 最小点权覆盖和最大点权独立集<br/>
        * MinimumDisjointPathCovering &nbsp; 最小不相交路径覆盖<br/>
        * MinimumJointPathCovering &nbsp; 最小可相交路径覆盖<br/>
        * Coloring &nbsp; 染色问题<br/>
* Chapter-6 - LinearAlgebra &nbsp; 线性代数<br/>
    * Matrix &nbsp; 矩阵<br/>
        * Strassen &nbsp; Strassen算法<br/>
        * GaussElimination &nbsp; 高斯消元法<br/>
        * LUP &nbsp; LUP分解<br/>
        * InverseMatrix &nbsp; 矩阵求逆<br/>
    * LinearProgramming &nbsp; 线性规划<br/>
        * Simplex &nbsp; 单纯形算法<br/>
        * Dinkelback &nbsp; Dinkelbach算法<br/>
* Chapter-7 - Calculation &nbsp; 数学计算<br/>
    * BasicCalculate &nbsp; 基础计算<br/>
        * LargeNumber &nbsp; 大数字<br/>
        * DecimalConversion &nbsp; 数字十进制与其他进制转换<br/>
        * Exponentiation &nbsp; 幂运算<br/>
    * CombinatorialMathematics &nbsp; 组合数学<br/>
        * Introduction-CombinatorialMathematics &nbsp; 组合数学介绍<br/>
        * FullPermutaion &nbsp; 全排列<br/>
        * Combination &nbsp; 组合<br/>
        * PermutationGroup &nbsp; 置换群<br/>
        * Catalan &nbsp; 卡特兰数<br/>
    * NumberTheory &nbsp; 数论<br/>
        * Sieve &nbsp; 筛选算法<br/>
        * Euclid &nbsp; Euclid算法<br/>
        * EuclidExtension &nbsp; Euclid扩展<br/>
        * ModularLinearEquation &nbsp; 模线性方程<br/>
        * ChineseRemainerTheorem &nbsp; 中国剩余定理<br/>
        * ModularExponentiation &nbsp; 模幂运算<br/>
* Chapter-8 - AnalyticGeometry &nbsp; 解析几何<br/>
    * VectorAndPolygon &nbsp; 向量与多边形<br/>
        * Cross &nbsp; 叉积<br/>
        * SegmentIntersection &nbsp; 线段相交<br/>
        * PointInConvexPolygon &nbsp; 点在凸多边形内<br/>
        * Sweeping &nbsp; 扫除算法<br/>
        * ConvexPolygonArea &nbsp; 凸多边形面积<br/>
        * ConvexPolygonGravityCenter &nbsp; 凸多边形重心<br/>
        * RayDistinguish &nbsp; 射线判别<br/>
        * RotatingCalipers &nbsp; 旋转卡壳<br/>
    * ConvexHull &nbsp; 凸包<br/>
        * NearestNeighbor &nbsp; 最近点对<br/>
        * GrahamScan &nbsp; Graham扫描<br/>
        * QuickConvexHull &nbsp; 快速凸包算法<br/>
* Chapter-9 - String &nbsp; 字符串<br/>
    * NaiveStringMatch &nbsp; 简单字符串匹配<br/>
    * KnuthMorrisPratt &nbsp; KMP算法<br/>
    * TrieTree &nbsp; 字典树<br/>
    * AhoCorasickAutomation &nbsp; AC自动机<br/>
* Chapter-10 - GameTheory &nbsp; 博弈论<br/>
    * BashGame &nbsp; 巴什博弈<br/>
    * WythoffGame &nbsp; 威佐夫博奕<br/>
    * NimGame &nbsp; 尼姆博弈<br/>
    * SpragueGrundy &nbsp; SG函数<br/>

####
-----------------
#### <p>Introduction - 内容概要</p>
&emsp;&emsp;这是一本关于大学生计算机算法的书籍。之所以称之为“书”而不是“源码”，是因为我发现单纯的代码很难让人学习和理解，我自己在学习的过程中走了不少的弯路。我认为将算法图形化、公式化是最容易让人学习和理解的方式，这样可以从数学角度来准确的描述问题和解法。因此我将这些内容用自己的方式画出来，配合代码和测试，希望给出一个比较令人满意的讲解。 <br/>
&emsp;&emsp;本书的每一章专门讲解一类算法问题，其中又划分多个小节，专门讲解其中的一个分支或变种。同一章节中各个小节之间会有明显的联系，基础的算法在前面，变种的、高级的算法在后面。每个算法都有讲解、源码和测试三个部分。在编写的过程中，我学习和参考了非常多的资料，有很多都忘记了，记得的我会列在参考资料中。   <br/>
&emsp;&emsp;后来NEWPLAN同学参加到这本书籍的编写中，他添加了很多内容，我们也欢迎更多的同学来一起丰富这些资料，不过有的时候我会调整一下代码规范，这是为了方便阅读。 <br/>
<br/>

<p>
作者： <br/>
NEWPLAN <br/>
林荣彬 <br/>
</p>

<p align="right">
西安交通大学计算机系<br/>
林荣彬<br/>
2014年2月16日<br/>
</p>


####
-----------------
#### <p>Reference - 参考资料</p>
* 算法导论 Introduction to Algorithms http://ce.bonabu.ac.ir/uploads/30/CMS/user/file/115/EBook/Introduction.to.Algorithms.3rd.Edition.Sep.2010.pdf </p>
* 背包问题九讲 http://love-oriented.com/pack/ </p>