Discussion:
Q: Let G = (V, E) be a connected and undirected graph, and u is a chosen vertex in V.
Suppose starting from u, exactly the same tree T is obtained using either breadth first search or depth first search.
Prove that G = T, where T is the BFS or DFS tree.