Professional Documents
Culture Documents
1
BFS-Demo
E F G H
front
FIFO Queue
3
E F G H
E F G H
E F G H
FIFO Queue
6
E F G H
FIFO Queue
7
E F G H
B discovered front B
E F G H
E F G H
I discovered front B I
FIFO Queue
10
E F G H
E F G H
E F G H
E F G H
E F G H
F discovered front I F
FIFO Queue
15
E F G H
E F G H
E F G H
E F G H
E F G H
E F G H
E F G H
E F G H
E F G H
I B
E discovered front F E
FIFO Queue
24
E F G H
I B
E F G H
I B
E F G H
I B
I finished front F E
FIFO Queue
27
E F G H
I B
E F G H
I B
E F G H
I B F
G discovered front E G
FIFO Queue
30
E F G H
I B F
F finished front E G
FIFO Queue
31
E F G H
I B F
E F G H
I B F
E F G H
I B F
E finished front G
FIFO Queue
34
E F G H
I B F
E F G H
I B F
FIFO Queue
36
E F G H
I B F
C discovered front C
FIFO Queue
37
E F G H
I B F
E F G H
I B F G
H discovered front C H
FIFO Queue
39
E F G H
I B F G
G finished front C H
FIFO Queue
40
E F G H
I B F G
E F G H
I B F G
E F G H
I B F G
D discovered front H D
FIFO Queue
43
E F G H
I B F G
C finished front H D
FIFO Queue
44
E F G H
I B F G
E F G H
I B F G
E F G H
I B F G
finished H front D
FIFO Queue
47
E F G H
I B F G
E F G H
I B F G
FIFO Queue
49
E F G H
I B F G
D finished front
FIFO Queue
50
E F G H
I B F G
FIFO Queue
51
E F G H
I B F G
STOP front
FIFO Queue
52
53
Visited Array
F C A
A B
B C
D
H D
E
G E
F
G
H
Visited Array
F C A
A B
B C
D
H D √
E
G E
F
G
D
H
The order nodes are visited:
D Visit D
55
Visited Array
F C A
A B
B C
D
H D √
E
G E
F
G
D
H
The order nodes are visited:
Consider nodes adjacent to D,
D decide to visit C first (Rule:
visit adjacent nodes in 56
alphabetical order)
BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956
Walk Through
F C A
A B
B
C √
D
H D √
E
G E F
G C
H D
The order nodes are visited:
Visit C
D, C
57
Visited Array
F C A
A B
B C √
D
H D √
E
G E
F
C
G
D
H
The order nodes are visited:
No nodes adjacent to C; cannot
D, C continue → backtrack, i.e.,
pop stack and restore 58
previous state
BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956
Walk-Through
Visited Array
F C A
A B
B C √
D
H D √
E
G E
F
G
D
H
The order nodes are visited:
Back to D – C has been visited,
D, C decide to visit E next
59
Visited Array
F C A
A B
B C √
D
H D √
E √
G E
F
E
G
D
H
The order nodes are visited:
Back to D – C has been visited,
D, C, E decide to visit E next
60
Visited Array
F C A
A B
B C √
D
H D √
E √
G E
F
E
G
D
H
The order nodes are visited:
Only G is adjacent to E
D, C, E
61
Visited Array
F C A
A B
B C √
D
H D √
E √
G E
G
F
E
G √
D
H
The order nodes are visited:
Visit G
D, C, E, G
62
Visited Array
F C A
A B
B C √
D
H D √
E √
G E
G
F
E
G √
D
H
The order nodes are visited:
Nodes D and H are adjacent to
D, C, E, G G. D has already been
visited. Decide to visit H. 63
BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956
Walk-Through
Visited Array
F C A
A B
B C √
D
H D √ H
E √
G E
G
F
E
G √
D
H √
The order nodes are visited:
Visit H
D, C, E, G, H
64
Visited Array
F C A
A B
B C √
D
H D √ H
E √
G E
G
F
E
G √
D
H √
The order nodes are visited:
Nodes A and B are adjacent to F.
D, C, E, G, H Decide to visit A next.
65
Visited Array
F C A √
A B
B C √ A
D
H D √ H
E √
G E
G
F
E
G √
D
H √
The order nodes are visited:
Visit A
D, C, E, G, H, A
66
Visited Array
F C A √
A B
B C √ A
D
H D √ H
E √
G E
G
F
E
G √
D
H √
The order nodes are visited:
Only Node B is adjacent to A.
D, C, E, G, H, A Decide to visit B next.
67
Visited Array
F C A √
A B √ B
B C √ A
D
H D √ H
E √
G E
G
F
E
G √
D
H √
The order nodes are visited:
Visit B
D, C, E, G, H, A, B
68
Visited Array
F C A √
A B √
B C √ A
D
H D √ H
E √
G E
G
F
E
G √
D
H √
The order nodes are visited:
No unvisited nodes adjacent to
D, C, E, G, H, A, B B. Backtrack (pop the stack).
69
Visited Array
F C A √
A B √
B C √
D
H D √ H
E √
G E
G
F
E
G √
D
H √
The order nodes are visited:
No unvisited nodes adjacent to
D, C, E, G, H, A, B A. Backtrack (pop the stack).
70
Visited Array
F C A √
A B √
B C √
D
H D √
E √
G E
G
F
E
G √
D
H √
The order nodes are visited:
No unvisited nodes adjacent to
D, C, E, G, H, A, B H. Backtrack (pop the
stack). 71
Visited Array
F C A √
A B √
B C √
D
H D √
E √
G E
F
E
G √
D
H √
The order nodes are visited:
No unvisited nodes adjacent to
D, C, E, G, H, A, B G. Backtrack (pop the
stack). 72
Visited Array
F C A √
A B √
B C √
D
H D √
E √
G E
F
G √
D
H √
The order nodes are visited:
No unvisited nodes adjacent to
D, C, E, G, H, A, B E. Backtrack (pop the stack).
73
Visited Array
F C A √
A B √
B C √
D
H D √
E √
G E
F
G √
D
H √
The order nodes are visited:
F is unvisited and is adjacent to
D, C, E, G, H, A, B D. Decide to visit F next.
74
Visited Array
F C A √
A B √
B C √
D
H D √
E √
G E
F √
F
G √
D
H √
The order nodes are visited:
Visit F
D, C, E, G, H, A, B, F
75
F C A √
A B √
B C √
D
H D √
E √
G E
F √
G √
D
H √
The order nodes are visited:
No unvisited nodes adjacent to
D, C, E, G, H, A, B, F F. Backtrack.
76
Visited Array
F C A √
A B √
B C √
D
H D √
E √
G E
F √
G √
H √
The order nodes are visited:
No unvisited nodes adjacent to
D, C, E, G, H, A, B, F D. Backtrack.
77
Visited Array
F C A √
A B √
B C √
D
H D √
E √
G E
F √
G √
H √
The order nodes are visited:
Stack is empty. Depth-first
D, C, E, G, H, A, B, F traversal is done.
78
79