Q27Comprehension3 Marks7 Aug 2022
Passage
Consider the following directed graph . Suppose DFS of this graph is performed from node , such that when we visit a vertex, we explore its unvisited neighbors in alphabetical order. Based on the above data, answer the given subquestions.
Find the number of cross edges in the DFS tree.
Press Enter to check.