Depth-first search: Difference between revisions

Revision as of 17:41, 10 September 2014

for each vertex u ∈ V [G]

do color[u] ← WHITE

π[u] ← NIL

time ← 0

do if color[u] == WHITE

then DFS-VISiT(u)

color[u] ← GRAY

time ← time + 1

d[u] ← time

for each v ∈ Adj[u]

do if color[v] = WHITE

then π [v] ← u

DFS-VISIT(v)

color[u] ← BLACK

f[u] ← time ← time + 1

@@ Line 1: / Line 1: @@
+[[Category:Algorithms]]
+[[Category:Search Algorithms]]
+[[Category:Tree Algorithms]]
 == Definition ==