QUESTION
Question No. 1:
Given the following graphs
convert it into a tree data structure.
A)
In the following graph consider node 1 as your starting point
B) In
the following graph consider node b
as your starting point.
Question No. 2:
Consider
the search space below, where 1 is
the start node and 10 is goal node.
Show with the sequence of
steps along with table displaying how do DFS
work on a given tree using simple search
algorithm.
ASSIGNMENT VIDEO
DOWNLOAD SOLUTION FILE
0 Comments