SELF DOUBT

Question

https://gateoverflow.in/200370/back-edge-tree-edge-forward-edges-in-bfs

WHAT IS THE PROOF OF 2ND STATEMENT IF IT IS CORRECT ?

Comments

i already provided the link in your another question... but coming to first one

take the example A->B, B->C, C->B, A->C ====> which DFS tree is A ->B, B->C then A is not cut vertex even though A have 2 childrens.