Given a directed graph, give an adjacency list representation of the graph that leads BFS to find the following spanning tree Given a directed graph:

give an adjacency list representation of the graph that leads Breadth first search to find the spanning tree in the left below. And give an adjacency list representation that leads to the right tree below.


I don't quite understand this question. Is it as simple as writing up the adjacency list for the graphs in the second picture? I would assume so if it weren't for the fact that I was given the directed graph. What do I use the directed graph for? I was thinking the adjacency list for the left would be
========================
A| B C
B| E D
C| F
D| G
E|
F|
I can't imagine that's right though. 

I assume that the point of the question is to make one adjacency list for the first directed graph (call it A) such that a BFS of that adjacency list produces the first tree (call it B) and another ordering of the adjacency list for A that produces C.
In other words, the question is about how you order the adjacency list of a directed graph such that the resulting tree from a BFS will have a particular order. You could think of it like a map from {'A', 'B', 'C', ... } to {0, 1, 2, ...} such that visiting the graph by BFS produces one particular tree.
