Consider the following statements:
S1 : DFS of a directed graph always produces the same number of edges in the traversal, irrespective of the starting vertex.
S2 : If all of the back edges that are found while DFS traversal on directed graph are removed, the resulting graph is acyclic.
Which of the following statements above are valid ?
This question is part of this quiz :
GATE 2017 MOCK II