Академический Документы
Профессиональный Документы
Культура Документы
Text
Read Weiss, 9.3 (pp. 299-304) Breadth-First
Search Algorithms
Requirements
Can be used to attempt to visit all nodes of a
graph in a systematic manner
Works with directed and undirected graphs
Works with weighted and unweighted graphs
Overview
F
A
B
Overview
F
A
B
H
G
Nodes visited: D
Overview
F
A
B
H
G
Nodes visited: D, C
Overview
F
A
B
H
G
Nodes visited: D, C, E
Overview
F
A
B
H
G
Nodes visited: D, C, E, F
Overview
F
A
B
E
2
Nodes visited: D, C, E, F, G
Overview
F
A
B
H
3
E
2
Nodes visited: D, C, E, F, G, H
Overview
4
A
B
H
3
E
2
Nodes visited: D, C, E, F, G, H, A
Overview
4
A
B
H
3
E
2
Nodes visited: D, C, E, F, G, H, A, B
Walk-Through
Enqueued Array
H
G
D
E
F
G
H
Walk-Through
Enqueued Array
H
G
QD
D
E
F
G
Nodes visited:
Walk-Through
Enqueued Array
H
G
QCEF
D
E
F
G
Nodes visited: D
Walk-Through
Enqueued Array
H
G
QEF
D
E
F
G
Nodes visited: D, C
Walk-Through
Enqueued Array
H
G
Q F G
D
E
F
G
Nodes visited: D, C, E
Walk-Through
Enqueued Array
H
G
QG
D
E
F
G
Nodes visited: D, C, E, F
Walk-Through
Enqueued Array
H
G
QH
D
E
F
G
Nodes visited: D, C, E, F, G
Walk-Through
Enqueued Array
H
G
Q A B
D
E
F
G
Nodes visited: D, C, E, F, G, H
Walk-Through
Enqueued Array
H
G
QB
D
E
F
G
Nodes visited: D, C, E, F, G, H, A
Walk-Through
Enqueued Array
H
G
Q empty
D
E
F
G
H
Nodes visited: D, C, E, F, G, H,
A, B
Dequeue B. Visit B. Enqueue unenqueued nodes
adjacent to B.
Walk-Through
Enqueued Array
H
G
Q empty
D
E
F
G
H
Nodes visited: D, C, E, F, G, H,
A, B
Q empty. Algorithm done.
Consider Trees
1. What do we call a breadth-first traversal on
trees?