Search, DFS, BFS, and DP
Built from the original search problem sets and solution notes, this post organizes DFS, BFS, pruning, shortest paths, and state-space search.
views
| comments
This is a short English draft for the Chinese article “搜索不是暴力：看懂 DFS、BFS 与 DP 的边界”. The full translation is not finished yet, but this page is enough to verify the bilingual blog flow.
Draft Summary#
This draft keeps only a short English opening for the algorithm topic. The complete derivations, formulas, and code snippets are still in the Chinese version.
Continue with the Chinese version if you want the complete notes, examples, proofs, and code snippets.