Name		Name	Last commit message	Last commit date
Latest commit History 54 Commits
Bellman-Ford(Queue-Optimised).cpp		Bellman-Ford(Queue-Optimised).cpp
Bellman-Ford.cpp		Bellman-Ford.cpp
Breadth-First-Search.cpp		Breadth-First-Search.cpp
Bubble-Sort.cpp		Bubble-Sort.cpp
Bucket-Sort.cpp		Bucket-Sort.cpp
Combination.cpp		Combination.cpp
Depth-First-Search.cpp		Depth-First-Search.cpp
Dijkstra(Heap-Optimised).cpp		Dijkstra(Heap-Optimised).cpp
Disjoint-Set-Union.cpp		Disjoint-Set-Union.cpp
Edmonds-Karp.cpp		Edmonds-Karp.cpp
Extended-Euclid.cpp		Extended-Euclid.cpp
Fast-Exponentiation.cpp		Fast-Exponentiation.cpp
Fenwick-Tree.cpp		Fenwick-Tree.cpp
Floyd-Warshall.cpp		Floyd-Warshall.cpp
Graham-Scan.cpp		Graham-Scan.cpp
Greatest-Common-Divisor.cpp		Greatest-Common-Divisor.cpp
Knuth-Morris-Pratt.cpp		Knuth-Morris-Pratt.cpp
Kruskal.cpp		Kruskal.cpp
Least-Common-Ancestor(Tarjan).cpp		Least-Common-Ancestor(Tarjan).cpp
Matrix-Multiplication(Naive).cpp		Matrix-Multiplication(Naive).cpp
Merge-Sort.cpp		Merge-Sort.cpp
Min-Heap.cpp		Min-Heap.cpp
Modular-Multiplicative-Inverse.cpp		Modular-Multiplicative-Inverse.cpp
Queue.cpp		Queue.cpp
Quick-Sort(Extra-Optimised).cpp		Quick-Sort(Extra-Optimised).cpp
Quick-Sort.cpp		Quick-Sort.cpp
README.md		README.md
Segment-Direction.cpp		Segment-Direction.cpp
Segment-Tree(Maximum).cpp		Segment-Tree(Maximum).cpp
Segment-Tree(Minimum).cpp		Segment-Tree(Minimum).cpp
Segment-Tree(Sum).cpp		Segment-Tree(Sum).cpp
Sparse-Table.cpp		Sparse-Table.cpp
Stack.cpp		Stack.cpp

Repository files navigation

Algorithms

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

--------------------------Contents--------------------------	--------------------------FileName--------------------------
单源最短路径（SPFA）	Bellman-Ford(Queue-Optimised)
单源最短路径（Bellman-Ford）	Bellman-Ford
广度优先搜索	Breadth-First-Search
冒泡排序	Bubble-Sort
桶排序	Bucket-Sort
枚举组合	Combination
深度优先搜索	Depth-First-Search
并查集	Disjoint-Set-Union
最大流（Edmonds-Karp）	Edmonds-Karp
拓展欧几里得算法	Extended-Euclid
简单的快速幂	Fast-Exponentiation
树状数组	Fenwick-Tree
辗转相除法求最大公约数	Greatest-Common-Divisor
字符串匹配（KMP）	Knuth-Morris-Pratt
最近公共祖先（Tarjan）	Least-Common-Ancestor(Tarjan)
朴素的矩阵乘法	Matrix-Multiplication(Naive)
归并排序	Merge-Sort
最小堆	Min-Heap
乘法逆元	Modular-Multiplicative-Inverse
快速排序的随机化版本	Quick-Sort(Randomized)
快速排序	Quick-Sort
线段树维护区间最大值	Segment-Tree(Maximum)
线段树维护区间和值	Segment-Tree(Sum)
ST表	Sparse-Table
栈的基本操作	Stack