Question: Consider running DFS on a digraph with n vertices, where some vertex v is discovered at time 1 1 and finished at time 2 0
Consider running DFS on a digraph with n vertices, where some vertex v is discovered at time and finished at time
Which of the following statements is correct in general? Recall that the vertices reachable from a vertex v include v itself.
Consider running DFS on a digraph with n vertices, where some vertex v is discovered at time and finished at time
Which of the following statements is correct in general? Recall that the vertices reachable from a vertex v include v itself.
At most vertices are reachable from v in G
At least vertices are reachable from v in G
vertices where discovered before the discovery of v
Since G is a digraph, and the search may have restarted, we can not say anything about the number of vertices reachable from v in G
Exactly vertices are reachable from v in G
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
