Question: Which tree is the breadth first search spanning tree of the directed graph (above) if starting at vertex H? When choosing successors, use the 367

Which tree is the breadth first search spanning tree of the directed graph (above) if starting at vertex H? When choosing successors, use the 367 convention of alphabetical increasing order A-Z.

| a). | i only |
| b). ii only |
| c). iii only |
| d). i and ii only |
| e). i, ii, and iii are all breadth-first search spanning trees starting at vertex H and following the 367 convention for selecting successors for the above directed graph. |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
