Algorithm
exploreDFS(v)
v.visited ← true
for each edge (v,w)
if not w.visited
exploreDFS(w)
Call Stack
Visited & Visit Order
Visited set
(empty)
Visit order
(none)