CS607 Assignment No.1 Solution

Question No. 1 Given the following graphs convert it into tree data structure. A)    In the following graph consider node 1 as your starting point B) In the following graph consider node a as your starting point. Question No. 2 Consider the search space below, where S is the start node and H is goal node. Show with the sequence of diagrams along with table displaying how does BFS work on given tree using simple search algorithm.