# Question: 1 find the breathfirst search tree and breathfirst distances for...

###### Question details

1) Find the breath-first search tree
and breath-first distances for the graph used in Example 7.7 (see
Figure 7.28, above) with *G* as the starting vertex under
the assumption about the adjacency-list order:

- Each adjacency list is in reverse alphabetical order.

**please explain it in detail**