depth first search Start at node a goal node is z Expand nei

depth first search. Start at node a goal node is z. Expand neighbours of a node in alphabetical order and break ties in alphabetical order.

a) Give the nodes; their order 1st to last. The path returned & cost of the path.

C 6 0 ) Eiht near mode, Eo \" tical elez. ndunnw) /t costcWy afeth

Solution

Solution:

path=> Z->Y->X->B->A->D->C->E
Cost=60

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary node as the root in the case of a graph) and explores as far as possible along each branch before backtracking.