Consider the following directed graph as shown below –
Which of the following statement is TRUE for the Depth first traversal (DFT) of the given directed graph ?
1
There are 8 Tree edges in the Depth first traversal (DFT) tree
2
There are 2 Forward edges in the Depth first traversal (DFT) tree
3
There is No cycle in the graph as there is no back edge in the Depth first traversal (DFT) tree
4
There are 3 Cross edges in the Depth first traversal (DFT) tree