How to Use This Series
This track organizes search algorithms by “families” (exploration, combinatorial search, and heuristic search). The goal is for you to navigate by technique, understand the mental model, and only then explore the code.
Tip: if you are coming from the Graph Theory series (Hamiltonian, for example),
start with Backtracking, then move on to IDA* and A*.
Index — Search Techniques
Below is the complete index. Finished items link directly to their pages. Topics under construction are clearly highlighted.
Exploration
Graph traversal algorithms that systematically explore vertices and edges of a graph.
Combinatorial Search
Techniques for exploring a space of candidate solutions under constraints.
Organization: algorithms “live” under Algorithm Design.
Problem-based series (e.g., Hamiltonian) simply reference these pages.