Let be a directed graph and a depth first search (DFS) spanning tree in that is rooted at a vertex . Suppose is also a breadth first search (BFS) tree in , rooted at . Which of the following statements is/are TRUE for every such graph and tree ?
- AThere are no back-edges in with respect to the tree .
- BThere are no cross-edges in with respect to the tree .
- CThere are no forward-edges in with respect to the tree .
- DThe only edges in are the edges in .

