TODO.md

Graphs

• BFS
• Connected components and BFS/DFS tree extraction
• Cycle detection in directed and undirected graphs
• Prim algorithm
• Shortest paths in DAGs via topological order
• A* search
• Johnson algorithm for APSP
• Tarjan algorithm for SCC
• Bridges, articulation points, and biconnected components
• Hopcroft-Karp algorithm
• Hungarian algorithm
• Dinic algorithm
• Min cost max flow
• Cut and separator problems
• Steiner tree via FPT algorithm

Interval and range queries

• Fenwick tree
• Segment tree with lazy propagation
• Difference array

Strings

• Z algorithm
• Suffix array and LCP array

Number theory and algebra

• Modular exponentiation
• Gaussian elimination

Geometry

• Point in polygon
• Distance and projection primitives
• Rotating calipers

Subsets and combinatorics

• Bitmask DP
• Meet in the middle
• Inclusion exclusion