Recursive DFS

ExhaustiveDFS(v) {

v.visited := true

for w in v.edgelist do

if w.visited = false then ExhaustiveDFS(w)}

main() {

ExhaustiveDFS(v0)}

What if G has multiple components, or G has one

component but is weakly connected?

Previous slide

Next slide

Back to first slide

View graphic version