Example

A

B

C

D

EDFS(A)

A.visited := true

No unvisited w in (C D) so return

How would you change EDFS to visit nodes “breadth first”?

ExhaustiveDFS(v) {

v.visited := true

for w in v.edgelist do

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

Previous slide

Next slide

Back to first slide

View graphic version