[Algorithm] DFS和Backtracking的区别
- DFS
Backtracking
Target Structure
Actual Tree/Graph Structure
Any type of structure where portions of the domain can be eliminated (Chess Board, matrix, implicit tree)
Definition
A specific form of backtracking related to searching tree/graph structures
Traverse from the end and prune unacceptable cases
Start-At Point
Root of the Tree
End of the Goal
Moving Direction
From the root to each branch
From the end moving backwards
关键字：dfs, 算法, tree, the
本文来自互联网用户投稿，文章观点仅代表作者本人，不代表本站立场，不承担相关法律责任。如若转载，请注明出处。 如若内容造成侵权/违法违规/事实不符，请点击【内容举报】进行投诉反馈！