Contains various algorithms needed for competitive programming
Graph Algorithms
Breadth First SearchDepth First SearchDijkstra's Algorithm- Floyd-Warshall Algorithm
- Bellman-Ford Algorithm
Prim's AlgorithmKruskal's Algorithm- Borkuva's Algorithm
- Heavy-Light Decomposition
- Strongly Connected Components
- Vertex Cover
- Edge Coloring
- Euler Tour
- Hamiltonian Cycle
Flow Algorithms
- Ford-Fulkerson Algorithm
- Dinic's Algorithm
- Push-Relabel Algorithm
- Min-Cost Max-Flow
- Maximum Bipartite Matching
- Hungarian Algorithm
Dynamic Programming
Geometry
Number Theory
String Algorithms
- Knuth-Morris-Pratt Algorithm
- Boyer-Moore Algorithm
- Z Algorithm
- Aho-Corasik Algorithm
- Longest Common Substring/Subsequence
- Shortest Common Superstring
- Longest Palindromic Substring
String Data Structures
Advanced Data Structures
Backtracking and Pruning
Misc
- Traveling Salesman Problem
- Lowest-Common-Ancestor