Algorithms

本次README修订为算法仓库Algorithms的第100次commit，首先我们庆祝自2016年8月4日本仓库建立以来Dev-XYS在算法学习方面取得的显著进步！

这里有各种算法的C++代码，任何人可以在自己的任何程序中使用，欢迎大家指出代码中的错误以及有待改进的地方。

本仓库内所有代码的授权方式为Unlicense，大家如果使用我的代码开发自己的软件挣了大钱，或是参考我的代码在NOI中得了金牌，我都会很高兴的。使用这里的代码之后，你可以自主选择是否公开源代码。总而言之，你可以把这里的代码当作你自己写的一样，无论怎样使用都是被允许的。但是，我不对本仓库内代码的正确性负责。大家要是使用我的代码开发软件而导致程序崩溃，或是参考我的代码在考试时出错，请不要向我抱怨。如果你愿意，遇到问题可以在Issues中提出来，我们共同解决。我们不赞成Pull Request，因为本仓库主要储存作者已经学习的算法，全部代码均由作者本人负责维护与更新。

以下索引提供了本仓库内算法的中文名，方便大家查找。更新可能有很长时间的延迟，不保证所有算法的名称都在列表中出现。

Index

--------------------------Contents--------------------------	--------------------------FileName--------------------------
AC自动机	Aho-Corasick-Automation
单源最短路径（SPFA）	Bellman-Ford(Queue-Optimised)
单源最短路径（Bellman-Ford）	Bellman-Ford
使用Edmonds-Karp进行二分图匹配	Bigrpah-Matching(Edmonds-Karp)
普通的二叉搜索树	Binary-Search-Tree
广度优先搜索	Breadth-First-Search
冒泡排序	Bubble-Sort
桶排序	Bucket-Sort
组合数的递推求解	Combination(Recursion)
枚举组合	Combination
基本的复数类	Complex-Number
割点	Cut-Vertex
深度优先搜索	Depth-First-Search
堆优化的Dijkstra算法	Dijkstra(Heap-Optimised)
并查集	Disjoint-Set-Union
最大流Edmonds-Karp算法	Edmonds-Karp
欧拉函数	Euler's-Totient-Function
有向图的欧拉回路	Eulerian-Tour(Digraph)
拓展欧几里得算法	Extended-Euclid
简单的快速幂	Fast-Exponentiation
树状数组	Fenwick-Tree
所有结点对之间的最短路径（Floyd）	Floyd-Warshall
凸包算法（Graham扫描法）	Graham-Scan
辗转相除法求最大公约数	Greatest-Common-Divisor
堆排序	Heap-Sort
ISAP算法	Improved-Shortest-Augmenting-Path(Naive)
插入排序	Insertion-Sort
字符串匹配（KMP）	Knuth-Morris-Pratt
最小生成树（Kruskal）	Kruskal
最近公共祖先（Tarjan）	Least-Common-Ancestor(Tarjan)
使用后缀数组求解最长公共子串	Longest-Common-Substring
最长上升子序列（n·log(n)）	Longest-Increasing-Subsequence(n·log(n))
倍增法求最近公共祖先	Lowest-Common-Ancestor(Doubling)
朴素的矩阵乘法	Matrix-Multiplication(Naive)
归并排序	Merge-Sort
最小堆	Min-Heap
乘法逆元	Modular-Multiplicative-Inverse
仅支持单点修改的可持久化线段树(维护区间和值）	Persistent-Segment-Tree(Sum)
试除法素数测试	Prime-Check(Naive)
线性的素数筛法	Prime-Sieve(Linear)
队列的基本操作	Queue
快速排序的优化版本	Quick-Sort(Extra-Optimised)
快速排序的随机化版本	Quick-Sort(Randomized)
快速排序	Quick-Sort
使用向量叉积判断两个有向线段的时针关系	Segment-Direction
线段树维护区间最大值	Segment-Tree(Maximum)
线段树维护区间最小值	Segment-Tree(Minimum)
线段树维护区间和值	Segment-Tree(Sum)
普通的选择算法	Selection
Eratosthenes素数筛法	Sieve-of-Erotosthenes
指针版的单向链表	Singly-Linked-List(Pointer)
跳表	Skip-List
ST表	Sparse-Table
伸展树	Splay
博弈论SG函数	Sprague-Grundy
栈的基本操作	Stack
递推法求解无符号第一类斯特林数	Stirling-Number(Cycle,Unsigned,Recursion)
递推法求解第二类斯特林数	Stirling-Number(Subset,Recursion)
倍增法求解后缀数组	Suffix-Array(Doubling)
倍增法求解后缀数组（附带Height数组）	Suffix-Array-with-Height(Doubling)
使用Tarjan算法求解强连通分量	Tarjan(Strongly-Connected-Components)
数组版的字典树	Trie(Array)
指针版的字典树	Trie(Pointer)

Name		Name	Last commit message	Last commit date
Latest commit History 147 Commits
.gitignore		.gitignore
2-Satisfiability.cpp		2-Satisfiability.cpp
Aho-Corasick-Automaton.cpp		Aho-Corasick-Automaton.cpp
Bellman-Ford(Queue-Optimised).cpp		Bellman-Ford(Queue-Optimised).cpp
Bellman-Ford.cpp		Bellman-Ford.cpp
Biconnected-Component.cpp		Biconnected-Component.cpp
Bigraph-Matching(Edmonds-Karp).cpp		Bigraph-Matching(Edmonds-Karp).cpp
Bigraph-Matching(Improved-Shortest-Augmenting-Path).cpp		Bigraph-Matching(Improved-Shortest-Augmenting-Path).cpp
Binary-Search-Tree.cpp		Binary-Search-Tree.cpp
Breadth-First-Search.cpp		Breadth-First-Search.cpp
Bubble-Sort.cpp		Bubble-Sort.cpp
Bucket-Sort.cpp		Bucket-Sort.cpp
Cartesian-Tree.cpp		Cartesian-Tree.cpp
Centre-of-Gravity(Polygon).cpp		Centre-of-Gravity(Polygon).cpp
Combination(Recursion).cpp		Combination(Recursion).cpp
Combination.cpp		Combination.cpp
Complex-Number.cpp		Complex-Number.cpp
Cut-Vertex.cpp		Cut-Vertex.cpp
Depth-First-Search.cpp		Depth-First-Search.cpp
Dijkstra(Heap-Optimised).cpp		Dijkstra(Heap-Optimised).cpp
Dinic.cpp		Dinic.cpp
Disjoint-Set-Union.cpp		Disjoint-Set-Union.cpp
Edmonds-Karp.cpp		Edmonds-Karp.cpp
Euler's-Totient-Function-Sieve(Linear).cpp		Euler's-Totient-Function-Sieve(Linear).cpp
Euler's-Totient-Function.cpp		Euler's-Totient-Function.cpp
Eulerian-Tour(Digraph).cpp		Eulerian-Tour(Digraph).cpp
Extended-Euclid.cpp		Extended-Euclid.cpp
Fast-Exponentiation.cpp		Fast-Exponentiation.cpp
Fast-Number-Theoretic-Transform.cpp		Fast-Number-Theoretic-Transform.cpp
Fenwick-Tree.cpp		Fenwick-Tree.cpp
Fibonacci-Heap.cpp		Fibonacci-Heap.cpp
Floyd-Warshall.cpp		Floyd-Warshall.cpp
Gaussian-Elimination.cpp		Gaussian-Elimination.cpp
Graham-Scan.cpp		Graham-Scan.cpp
Greatest-Common-Divisor.cpp		Greatest-Common-Divisor.cpp
Heap-Sort.cpp		Heap-Sort.cpp
Heavy-Light-Decomposition.cpp		Heavy-Light-Decomposition.cpp
High-Precision(Integer).cpp		High-Precision(Integer).cpp
Hungarian-Algorithm.cpp		Hungarian-Algorithm.cpp
Improved-Shortest-Augmenting-Path(Gap-Optimised).cpp		Improved-Shortest-Augmenting-Path(Gap-Optimised).cpp
Improved-Shortest-Augmenting-Path(Naive).cpp		Improved-Shortest-Augmenting-Path(Naive).cpp
Insertion-Sort.cpp		Insertion-Sort.cpp
K-Dimensional-Tree.cpp		K-Dimensional-Tree.cpp
Knuth-Morris-Pratt.cpp		Knuth-Morris-Pratt.cpp
Kruskal.cpp		Kruskal.cpp
Least-Common-Ancestor(Tarjan).cpp		Least-Common-Ancestor(Tarjan).cpp
Leftist-Tree.cpp		Leftist-Tree.cpp
Linear-Basis.cpp		Linear-Basis.cpp
Link-Cut-Tree(with-Reverse).cpp		Link-Cut-Tree(with-Reverse).cpp
Link-Cut-Tree.cpp		Link-Cut-Tree.cpp
Longest-Common-Substring.cpp		Longest-Common-Substring.cpp
Longest-Increasing-Subsequence(n·log(n)).cpp		Longest-Increasing-Subsequence(n·log(n)).cpp
Lowest-Common-Ancestor(Doubling).cpp		Lowest-Common-Ancestor(Doubling).cpp
Matrix-Multiplication(Naive).cpp		Matrix-Multiplication(Naive).cpp
Merge-Sort.cpp		Merge-Sort.cpp
Miller-Rabin.cpp		Miller-Rabin.cpp
Min-Heap.cpp		Min-Heap.cpp
Modular-Multiplicative-Inverse-Sieve(Factorial,Linear).cpp		Modular-Multiplicative-Inverse-Sieve(Factorial,Linear).cpp
Modular-Multiplicative-Inverse-Sieve(Linear).cpp		Modular-Multiplicative-Inverse-Sieve(Linear).cpp
Modular-Multiplicative-Inverse.cpp		Modular-Multiplicative-Inverse.cpp
Non-Rotating-Treap.cpp		Non-Rotating-Treap.cpp
Palindromic-Tree.cpp		Palindromic-Tree.cpp
Permutation.cpp		Permutation.cpp
Persistent-Array.cpp		Persistent-Array.cpp
Persistent-Segment-Tree(Sum).cpp		Persistent-Segment-Tree(Sum).cpp
Persistent-Treap.cpp		Persistent-Treap.cpp
Persistent-Trie.cpp		Persistent-Trie.cpp
Prim.cpp		Prim.cpp
Prime-Check(Naive).cpp		Prime-Check(Naive).cpp
Prime-Sieve(Linear).cpp		Prime-Sieve(Linear).cpp
Primitive-Root.cpp		Primitive-Root.cpp
Prüfer-Sequence(Tree-to-Sequence).cpp		Prüfer-Sequence(Tree-to-Sequence).cpp
Queue.cpp		Queue.cpp
Quick-Sort(Extra-Optimised).cpp		Quick-Sort(Extra-Optimised).cpp
Quick-Sort(Randomized).cpp		Quick-Sort(Randomized).cpp
Quick-Sort.cpp		Quick-Sort.cpp
Radix-Sort.cpp		Radix-Sort.cpp
Reverse-Pair(Merge-Sort).cpp		Reverse-Pair(Merge-Sort).cpp
Segment-Direction.cpp		Segment-Direction.cpp
Segment-Intersection.cpp		Segment-Intersection.cpp
Segment-Tree(Minimum).cpp		Segment-Tree(Minimum).cpp
Segment-Tree(Sum).cpp		Segment-Tree(Sum).cpp
Selection.cpp		Selection.cpp
Sieve-of-Eratosthenes.cpp		Sieve-of-Eratosthenes.cpp
Singly-Linked-List(Pointer).cpp		Singly-Linked-List(Pointer).cpp
Skip-List.cpp		Skip-List.cpp
Sparse-Table.cpp		Sparse-Table.cpp
Splay(Single-Rotation).cpp		Splay(Single-Rotation).cpp
Splay-with-Parent(Array).cpp		Splay-with-Parent(Array).cpp
Splay.cpp		Splay.cpp
Sprague-Grundy.cpp		Sprague-Grundy.cpp
Stack.cpp		Stack.cpp
Stirling-Number(Cycle,Unsigned,Recursion).cpp		Stirling-Number(Cycle,Unsigned,Recursion).cpp
Stirling-Number(Subset,Recursion).cpp		Stirling-Number(Subset,Recursion).cpp
Suffix-Array(Doubling).cpp		Suffix-Array(Doubling).cpp
Suffix-Array-with-Height(Doubling).cpp		Suffix-Array-with-Height(Doubling).cpp
Suffix-Automaton.cpp		Suffix-Automaton.cpp
Tarjan(Strongly-Connected-Components).cpp		Tarjan(Strongly-Connected-Components).cpp
Treap.cpp		Treap.cpp
Trie(Array).cpp		Trie(Array).cpp

License

harrypotter0/Algorithms-3

Folders and files

Latest commit

History