Demo Breadth First Search
Slides source for BDF-DIGRAPH demo: http://www.cc.gatech.edu/~bader/COURSES/GATECH/CS6505-Spring2006/demo-bfs.ppt
Breadth First Search - Directed Graph
2
s
4
5
3
8
7
6
9
2
Breadth First Search - Directed Graph
Shortest path
from s
0
1
2
s
4
5
3
8
7
6
9
Undiscovered
Discovered
FIFO Queue: s
Top of queue
Finished
3
Breadth First Search - Directed Graph
1
2
0
s
4
5
3
8
7
6
9
1
Undiscovered
Discovered
FIFO Queue: s 2
Top of queue
Finished
4
Breadth First Search - Directed Graph
1
2
0
4
5
s
8
7
1
3
6
9
1
Undiscovered
Discovered
FIFO Queue: s 2 3
Top of queue
Finished
5
Breadth First Search - Directed Graph
1
2
0
s
4
5
8
7
1
3
6
9
1
Undiscovered
Discovered
FIFO Queue: 2 3 5
Top of queue
Finished
6
Breadth First Search - Directed Graph
0
1
2
2
4
s
5
8
7
1
3
6
9
1
Undiscovered
Discovered
FIFO Queue: 2 3 5
Top of queue
Finished
7
Breadth First Search - Directed Graph
0
1
2
2
4
s
5 already discovered:
7
don't enqueue
5
1
3
8
6
9
1
Undiscovered
Discovered
FIFO Queue: 2 3 5 4
Top of queue
Finished
8
Breadth First Search - Directed Graph
0
1
2
2
4
s
5
8
7
1
3
6
9
1
Undiscovered
Discovered
FIFO Queue: 2 3 5 4
Top of queue
Finished
9
Breadth First Search - Directed Graph
0
1
2
2
4
s
5
8
7
1
3
6
9
1
Undiscovered
Discovered
FIFO Queue: 3 5 4
Top of queue
Finished
10
Breadth First Search - Directed Graph
0
1
2
2
4
s
5
8
7
1
3
6
1
2
9
Undiscovered
Discovered
FIFO Queue: 3 5 4
Top of queue
Finished
11
Breadth First Search - Directed Graph
0
1
2
2
4
s
5
8
7
1
3
6
1
2
9
Undiscovered
Discovered
FIFO Queue: 3 5 4 6
Top of queue
Finished
12
Breadth First Search - Directed Graph
0
1
2
2
4
s
5
8
7
1
3
6
1
2
9
Undiscovered
Discovered
FIFO Queue: 5 4 6
Top of queue
Finished
13
Breadth First Search - Directed Graph
0
1
2
2
4
s
5
8
7
1
3
6
1
2
9
Undiscovered
Discovered
FIFO Queue: 5 4 6
Top of queue
Finished
14
Breadth First Search - Directed Graph
0
1
2
2
4
s
5
8
7
1
3
6
1
2
9
Undiscovered
Discovered
FIFO Queue: 4 6
Top of queue
Finished
15
Breadth First Search - Directed Graph
0
1
2
3
2
4
8
s
5
7
1
3
6
1
2
9
Undiscovered
Discovered
FIFO Queue: 4 6
Top of queue
Finished
16
Breadth First Search - Directed Graph
0
1
2
3
2
4
8
s
5
7
1
3
6
1
2
9
Undiscovered
Discovered
FIFO Queue: 4 6 8
Top of queue
Finished
17
Breadth First Search - Directed Graph
0
1
2
3
2
4
8
s
5
7
1
3
3
6
1
2
9
Undiscovered
Discovered
FIFO Queue: 6 8
Top of queue
Finished
18
Breadth First Search - Directed Graph
0
1
2
3
2
4
8
s
5
7
1
3
3
6
9
1
2
3
Undiscovered
Discovered
FIFO Queue: 6 8 7
Top of queue
Finished
19
Breadth First Search - Directed Graph
0
1
2
3
2
4
8
s
5
7
1
3
3
6
9
1
2
3
Undiscovered
Discovered
FIFO Queue: 6 8 7 9
Top of queue
Finished
20
Breadth First Search - Directed Graph
0
1
2
3
2
4
8
s
5
7
1
3
3
6
9
1
2
3
Undiscovered
Discovered
FIFO Queue: 8 7 9
Top of queue
Finished
21
Breadth First Search - Directed Graph
0
1
2
3
2
4
8
s
5
7
1
3
3
6
9
1
2
3
Undiscovered
Discovered
FIFO Queue: 7 9
Top of queue
Finished
22
Breadth First Search - Directed Graph
0
1
2
3
2
4
8
s
5
7
1
3
3
6
9
1
2
3
Undiscovered
Discovered
FIFO Queue: 7 9
Top of queue
Finished
23
Breadth First Search - Directed Graph
0
1
2
3
2
4
8
s
5
7
1
3
3
6
9
1
2
3
Undiscovered
Discovered
FIFO Queue: 7 9
Top of queue
Finished
24
Breadth First Search - Directed Graph
0
1
2
3
2
4
8
s
5
7
1
3
3
6
9
1
2
3
Undiscovered
Discovered
FIFO Queue: 7 9
Top of queue
Finished
25
Breadth First Search - Directed Graph
0
1
2
3
2
4
8
s
5
7
1
3
3
6
9
1
2
3
Undiscovered
Discovered
FIFO Queue: 9
Top of queue
Finished
26
Breadth First Search - Directed Graph
0
1
2
3
2
4
8
s
5
7
1
3
3
6
9
1
2
3
Undiscovered
Discovered
FIFO Queue: 9
Top of queue
Finished
27
Breadth First Search - Directed Graph
0
1
2
3
2
4
8
s
5
7
1
3
3
6
9
1
2
3
Undiscovered
Discovered
FIFO Queue: 9
Top of queue
Finished
28
Breadth First Search - Directed Graph
0
1
2
3
2
4
8
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
0
1
2
3
2
4
8
s
5
7
1
3
3
6
9
1
2
3
Level Graph
30