Sunday, July 6, 2014

Depth First Search Procedure

Algorithm : Depth-First Search

   1. place the starting node in the queue.

   2. If the queue is empty, return failure and stop.

   3. If the first element on the queue is a goal node g , return succed and stop otherwise.

   4. Remove and expand the first element and place the children at the front of the queue.

   5.Go back to step 2.

No comments:

Post a Comment