Depth first search.

2.8kviews

Depth first search.

written 6.8 years ago by

teamques10 ★ 70k

modified 4.3 years ago by

krithikkm200 • 10

artificial intelligence data structures and algorithms

ADD COMMENT EDIT

1 Answer

73views

written 6.8 years ago by

teamques10 ★ 70k

DFS always expands the deepest node in the current fringe of the search tree. The progress of the search is illustrated in figure (8). The search proceeds immediately to the deepest level of the search tree, where the nodes have no successors. As those nodes are expanded, they are dropped …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.