You are given a directed graph G = (V, E). Give an algorithm based on DFS that determines in O(V + E) time whether there is a cycle in G.

Sample DFS algorithm:

Does this answer the question or does it need to be modified?

parent-s: Nonej DFS-visit (V, Adj, s): for v in Adj [s]: if v not in parent: parent [v]s DFS-visit (V, Adj, v) DFS CV, Adj) parent for s in V: if s not in parent: parent [s] None DFS-visit (V, Adj, s)