Question: The adjacency list representation of a graph G , which has 7 vertices and 10 edges, is: (a)Show the breadth-first search tree that is built
The adjacency list representation of a graph G, which has 7 vertices and 10 edges, is:

(a)Show the breadth-first search tree that is built by running BFS on graph G with the given adjacency list, using vertex a as the source.
(b)Indicate the edges in G that are NOT in the BFS tree in part (a) by dashed lines.
(c)Show the depth-first search tree that is built by running DFS on graph G with the given adjacency list, using vertex a as the source.
(d)Indicate the edges in G which are NOT in the DFS (c) by dashed lines.
g a d, e, b, g cf, e, b, d ea, c, b ga b e, c, a d c, a, f fd, c d a e b C
Step by Step Solution
3.44 Rating (154 Votes )
There are 3 Steps involved in it
Solutions Step 1 a To perform a breadthfirst search BFS on the given graph G with the specified adjacency list we start from the source vertex a and e... View full answer
Get step-by-step solutions from verified subject matter experts
