Demo Breadth First Search

Slides source for BDF-DIGRAPH demo: http://www.cc.gatech.edu/~bader/COURSES/GATECH/CS6505-Spring2006/demo-bfs.ppt 1

Breadth First Search - Directed Graph
2 4 8

s 5 7

3 6 9

2
Breadth First Search - Directed Graph
1
2 4 8

0 s 5 7

3 6 9

Undiscovered
Discovered FIFO Queue: s

Top of queue
Finished 3
Breadth First Search - Directed Graph
1
2 4 8

0 s 5 7

3 6 9

Undiscovered
Discovered FIFO Queue: 2

Top of queue
Finished 4
Breadth First Search - Directed Graph
1
2 4 8

0 s 5 7
1

3 6 9

Undiscovered
Discovered FIFO Queue: 2 3

Top of queue
Finished 5
Breadth First Search - Directed Graph
1
2 4 8

0 s 5 7
1

3 6 9

Undiscovered
Discovered FIFO Queue: 2 3 5

Top of queue
Finished 6
Breadth First Search - Directed Graph
1 2
2 4 8

0 s 5 7
1

3 6 9

Undiscovered
Discovered FIFO Queue: 3 5

Top of queue
Finished 7
Breadth First Search - Directed Graph
1 2
2 4 8

5 already discovered:
0 s 5 7
don't enqueue
1

3 6 9

Undiscovered
Discovered FIFO Queue: 3 5 4

Top of queue
Finished 8
Breadth First Search - Directed Graph
1 2
2 4 8

0 s 5 7
1

3 6 9

Undiscovered
Discovered FIFO Queue: 3 5 4

Top of queue
Finished 9
Breadth First Search - Directed Graph
1 2
2 4 8

0 s 5 7
1

3 6 9

Undiscovered
Discovered FIFO Queue: 5 4

Top of queue
Finished 10
Breadth First Search - Directed Graph
1 2
2 4 8

0 s 5 7
1

3 6 9

1 2

Undiscovered
Discovered FIFO Queue: 5 4

Top of queue
Finished 11
Breadth First Search - Directed Graph
1 2
2 4 8

0 s 5 7
1

3 6 9

1 2

Undiscovered
Discovered FIFO Queue: 5 4 6

Top of queue
Finished 12
Breadth First Search - Directed Graph
1 2
2 4 8

0 s 5 7
1

3 6 9

1 2

Undiscovered
Discovered FIFO Queue: 4 6

Top of queue
Finished 13
Breadth First Search - Directed Graph
1 2
2 4 8

0 s 5 7
1

3 6 9

1 2

Undiscovered
Discovered FIFO Queue: 4 6

Top of queue
Finished 14
Breadth First Search - Directed Graph
1 2
2 4 8

0 s 5 7
1

3 6 9

1 2

Undiscovered
Discovered FIFO Queue: 6

Top of queue
Finished 15
Breadth First Search - Directed Graph
1 2 3
2 4 8

0 s 5 7
1

3 6 9

1 2

Undiscovered
Discovered FIFO Queue: 6

Top of queue
Finished 16
Breadth First Search - Directed Graph
1 2 3
2 4 8

0 s 5 7
1

3 6 9

1 2

Undiscovered
Discovered FIFO Queue: 6 8

Top of queue
Finished 17
Breadth First Search - Directed Graph
1 2 3
2 4 8

0 s 5 7
1 3

3 6 9

1 2

Undiscovered
Discovered FIFO Queue: 8

Top of queue
Finished 18
Breadth First Search - Directed Graph
1 2 3
2 4 8

0 s 5 7
1 3

3 6 9

1 2 3

Undiscovered
Discovered FIFO Queue: 8 7

Top of queue
Finished 19
Breadth First Search - Directed Graph
1 2 3
2 4 8

0 s 5 7
1 3

3 6 9

1 2 3

Undiscovered
Discovered FIFO Queue: 8 7 9

Top of queue
Finished 20
Breadth First Search - Directed Graph
1 2 3
2 4 8

0 s 5 7
1 3

3 6 9

1 2 3

Undiscovered
Discovered FIFO Queue: 7 9

Top of queue
Finished 21
Breadth First Search - Directed Graph
1 2 3
2 4 8

0 s 5 7
1 3

3 6 9

1 2 3

Undiscovered
Discovered FIFO Queue: 9

Top of queue
Finished 22
Breadth First Search - Directed Graph
1 2 3
2 4 8

0 s 5 7
1 3

3 6 9

1 2 3

Undiscovered
Discovered FIFO Queue: 9

Top of queue
Finished 23
Breadth First Search - Directed Graph
1 2 3
2 4 8

0 s 5 7
1 3

3 6 9

1 2 3

Undiscovered
Discovered FIFO Queue: 9

Top of queue
Finished 24
Breadth First Search - Directed Graph
1 2 3
2 4 8

0 s 5 7
1 3

3 6 9

1 2 3

Undiscovered
Discovered FIFO Queue: 9

Top of queue
Finished 25
Breadth First Search - Directed Graph
1 2 3
2 4 8

0 s 5 7
1 3

3 6 9

1 2 3

Undiscovered
Discovered FIFO Queue:

Top of queue
Finished 26
Breadth First Search - Directed Graph
1 2 3
2 4 8

0 s 5 7
1 3

3 6 9

1 2 3

Undiscovered
Discovered FIFO Queue:

Top of queue
Finished 27
Breadth First Search - Directed Graph
1 2 3
2 4 8

0 s 5 7
1 3

3 6 9

1 2 3

Undiscovered
Discovered FIFO Queue:

Top of queue
Finished 28
Breadth First Search - Directed Graph
1 2 3
2 4 8

0 s 5 7
1 3

3 6 9

1 2 3

Undiscovered
Discovered FIFO Queue:

Top of queue
Finished 29
Breadth First Search - Directed Graph
1 2 3
2 4 8

0 s 5 7
1 3

3 6 9

1 2 3

Level Graph

30
Demo Depth First Search

https://www.cs.princeton.edu/courses/archive/spr10/cos226/demo/demo-dfs-directed.ppt

31
Directed Depth First Search
A

Adjacency Lists
A: F G
B H C G
B: A I
C: A D
D: C F
I E: C D G
F: E:
D
G: :
H: B:
E I: H:
F

32
Directed Depth First Search
A

B H C G

E
F

dfs(A)
A-F A-G

Function call stack: 33

Directed Depth First Search
A

B H C G

E
F
visit(F)
F-E

dfs(A)
A-F A-G

Function call stack: 34

Directed Depth First Search
A

B H C G

D
dfs(E)
E-C E-D E-G
E
F
dfs(F)
F-E

dfs(A)
A-F A-G

Function call stack: 35

Directed Depth First Search
A

B H C G

dfs(C)
I C-A C-D
D
dfs(E)
E-C E-D E-G
E
F
dfs(F)
F-E

dfs(A)
A-F A-G

Function call stack: 36

Directed Depth First Search
A

B H C G

dfs(C)
I C-A C-D
D
dfs(E)
E-C E-D E-G
E
F
dfs(F)
F-E

dfs(A)
A-F A-G

Function call stack: 37

Directed Depth First Search
A

dfs(D)
B H D-C D-F
C G

dfs(C)
I C-A C-D
D
dfs(E)
E-C E-D E-G
E
F
dfs(F)
F-E

dfs(A)
A-F A-G

Function call stack: 38

Directed Depth First Search
A

dfs(D)
B H D-C D-F
C G

dfs(C)
I C-A C-D
D
dfs(E)
E-C E-D E-G
E
F
dfs(F)
F-E

dfs(A)
A-F A-G

Function call stack: 39

Directed Depth First Search
A

dfs(D)
B H D-C D-F
C G

dfs(C)
I C-A C-D
D
dfs(E)
E-C E-D E-G
E
F
dfs(F)
F-E

dfs(A)
A-F A-G

Function call stack: 40

Directed Depth First Search
A

B H C G

dfs(C)
I C-A C-D
D
dfs(E)
E-C E-D E-G
E
F
dfs(F)
F-E

dfs(A)
A-F A-G

Function call stack: 41

Directed Depth First Search
A

B H C G

D
dfs(E)
E-C E-D E-G
E
F
dfs(F)
F-E

dfs(A)
A-F A-G

Function call stack: 42

Directed Depth First Search
A

B H C G

D
dfs(E)
E-C E-D E-G
E
F
dfs(F)
F-E

dfs(A)
A-F A-G

Function call stack: 43

Directed Depth First Search
A

B H C G

dfs(G)
I

D
dfs(E)
E-C E-D E-G
E
F
dfs(F)
F-E

dfs(A)
A-F A-G

Function call stack: 44

Directed Depth First Search
A

B H C G

D
dfs(E)
E-C E-D E-G
E
F
dfs(F)
F-E

dfs(A)
A-F A-G

Function call stack: 45

Directed Depth First Search
A

B H C G

E
F
dfs(F)
F-E

dfs(A)
A-F A-G

Function call stack: 46

Directed Depth First Search
A

B H C G

E
F

dfs(A)
A-F A-G

Function call stack: 47

Directed Depth First Search
A

B H C G

E
F

dfs(A)
A-F A-G

Function call stack: 48

Directed Depth First Search
A

B H C G

E
F

Nodes reachable from A: A, C, D, E, F, G 49