Question: 1. Perform a breadth-first search (BFS) of this directed graph, starting at node A. When you have a choice of the next node to process,

1. Perform a breadth-first search (BFS) of this directed graph, starting at node A. When you have a choice of the next node to process, choose the one earliest in the alphabet. Thus, the costs are meaningless in this context. In terms of the queue, the first element should be in the Node @ Head column, the other nodes on the queue should be in the proper order. (0.5 pt per row)
Solution: Write the solution by filling in the table as was done on the inclass exercise W2. See answer key on D2L.
| . Node | Nr. edges from start | Prev Node | Queue after processing node | ||||||||||||||
| Node @ Head | Nr edges from start | Prev node | Nr edges from start | Prev node | Nr edges from start | Prev node | Nr edges from start | Prev Node | Nr edges from start | Prev Node | |||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |||
|
|
|
|
|
|
| ||||||||||||
|
|
|
|
|
|
|
| |||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
