Depth-First and Breadth-First Search
In addition to specifying a search direction datadriven or goaldriven a search algorithm must determine the order in which states are examined in the tree or the graph This section considers two possibilities for the order in which the nodes of the graph are considered
Embed this Presentation
Available Downloads
Download Notice
Download Presentation The PPT/PDF document "Depth-First and Breadth-First Search" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.