回溯和DFS的区别

最新推荐文章于 2025-10-30 16:59:30 发布

原创最新推荐文章于 2025-10-30 16:59:30 发布 · 3.7k 阅读

2 ·

CC 4.0 BY-SA版权

文章标签：

#algorithm

算法专栏收录该内容

1 篇文章

订阅专栏

本文介绍了两种重要的计算机算法：回溯法和深度优先搜索。回溯法是一种通用算法，用于解决约束满足问题，通过逐步构建候选解决方案并在确定无法完成有效解决方案时回退。深度优先搜索则是一种用于遍历或搜索树或图数据结构的算法，从根节点开始尽可能深入地探索每个分支。

Definition:

Backtracking is a general algorithm for finding all (or some) solutions to some computational problems, notably constraint satisfaction problems, that incrementally builds candidates to the solutions, and abandons each partial candidate c ("backtracks") as soon as it determines that c cannot possibly be completed to a valid solution.

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary node as the root in the case of a graph) and explores as far as possible along each branch before backtracking.