DFS BFS

Question

Please give an example i didn't get it

The depth of any DFS tree rooted at a vertex is at least as much as the
depth of any BFS tree rooted at the same vertex.

Comments

What the question means,

take a connected graph and label the vertices

apply DFS and BFS on them.

Note that, When you apply BFS on a node, all it's neighbor should be on same level.

Now Compare the BFS and DFS trees,

If a node Vi is in level X in BFS, In the DFS Vi should be in the level ≥ X

---

thanks, got it