- DFS (Topological Sort, Strongly Connected Components)
- BFS
- Eulerian path
- Hamiltonian path
- Dijkstra's
- Prim's (Minimum Spanning Tree)
- Kruskal's (Minimum Spanning Tree)
- Floyd Warhsall (Multiple Source Shortest Path)
- Bellman Ford (Single Source shortest path with negative edges)
- Johnson’s algorithm for sparse graphs (MUltiple Source Shortest Path)
- Ford-Fulkerson method for maximum flow
- Edmonds-Karp algorithm for maximum flow
- Bipartite matching
- [Longest path problem](Longest path problem)
- Graham Scan
- Shortest Path with polygon obstacles
- Intersections
- Fixed-Radius Near Neighbor Problem
- Bently Ottmann
- Knuth Morris Pratt
- Suffix arrays
- Longest Common Substring
- Sieve of that greek guy
- brute force prime test
- N choose R
- Chinese Remainder Theorem
- GCD