Scribd
Upload
40 views1 page

Depth-First Search Overview and Quiz

Depth-first search is an algorithm that explores as far as possible along each branch before backtracking. A depth-first search of the graph Start -> A -> C -> D -> Goal would explore the path Start -> A -> C -> D before returning to explore other branches. The shallowest node would be found using breadth-first search instead of depth-first search.

Uploaded by

Kien An
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
40 views1 page

Depth-First Search Overview and Quiz

Depth-first search is an algorithm that explores as far as possible along each branch before backtracking. A depth-first search of the graph Start -> A -> C -> D -> Goal would explore the path Start -> A -> C -> D before returning to explore other branches. The shallowest node would be found using breadth-first search instead of depth-first search.

Uploaded by

Kien An
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd

Depth-first search: Slide lecture 03 P50

Quiz: Start -> A -> C-> D -> Goal

shallowest node -> BFS

You might also like