private void DFS(Digraph g, int v) { onStack[v] = true; marked[v] = true; foreach (var w in g.Adj(v)) { if (HasCycle()) { return; } else if (!marked[w]) { edgeTo[w] = v; DFS(g, w); } else if (onStack[w]) { cycle = new Stack <int>(); for (int x = v; x != w; x = edgeTo[x]) { cycle.Push(x); } cycle.Push(w); cycle.Push(v); } onStack[v] = false; } }
public void DFS(Digraph g, int v) { marked[v] = true; foreach (var i in g.Adj(v)) { if (!marked[i]) { DFS(g, i); } } }
private void DFS(Digraph g, int v) { pre.Enqueue(v); marked[v] = true; foreach (var i in g.Adj(v)) { if (!marked[i]) { DFS(g, i); } } post.Enqueue(v); reversePost.Push(v); }