a)Unit 1Explain breadth first search algorithm. Give an example of a problem for which breadth first search would work better than depth first search.
Explain breadth first search algorithm. Give an example of a problem for which breadth first search would work better than depth first search.
b)Unit 1Find the shortest path using A* algorithm. Where A* algorithm is shown below. alt=''
Nodes S A B C D G H(n) 5 3 4 2 6 0
Find the shortest path using A* algorithm. Where A* algorithm is shown below. alt=''
| Nodes | S | A | B | C | D | G |
|---|---|---|---|---|---|---|
| H(n) | 5 | 3 | 4 | 2 | 6 | 0 |