Chapter 3, Problem 21E

Program Plan Intro

Breadth-first search:

• Breadth First Search (BFS), is the algorithm that traverses or searches tree or graph data structures.
• The search starts with the tree root, and then explores all the neighbor nodes at the present depth before moving to the nodes at the next depth level.
• The strategy used in this is quite opposite to depth-first search.

Depth First Search:

• Depth First Search (DFS), is the algorithm to traverse or search tree or graph data structures.
• The search starts with the root node, and then explores as far as possible along each branch before backtracking.

Uniform Cost Search:

• Uniform Cost Search (UCS) is the algorithm known to best for a search problem, and this does not include the use of heuristics.
• It solves any general graph for an optimal cost.
• Uniform cost search searches the branches which are more or less the same in cost.