Download presentation

Presentation is loading. Please wait.

Published byDerrick Powers Modified over 2 years ago

1
Breadth-First Search Text Read Weiss, § 9.3 (pp. 299-304) Breadth-First Search Algorithms

2
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

3
A H B F E D C G Overview Task: Conduct a breadth-first search of the graph starting with node D Breadth-first search starts with given node 0

4
A H B F E D C G Overview Nodes visited: D Breadth-first search starts with given node Then visits nodes adjacent in some specified order (e.g., alphabetical) Like ripples in a pond 0 1

5
A H B F E D C G Overview Nodes visited: D, C Breadth-first search starts with given node Then visits nodes adjacent in some specified order (e.g., alphabetical) Like ripples in a pond 0 1

6
A H B F E D C G Overview Nodes visited: D, C, E Breadth-first search starts with given node Then visits nodes adjacent in some specified order (e.g., alphabetical) Like ripples in a pond 0 1

7
A H B F E D C G Overview Nodes visited: D, C, E, F Breadth-first search starts with given node Then visits nodes adjacent in some specified order (e.g., alphabetical) Like ripples in a pond 0 1

8
A H B F E D C G Overview Nodes visited: D, C, E, F, G When all nodes in ripple are visited, visit nodes in next ripples 0 2 1

9
A H B F E D C G Overview Nodes visited: D, C, E, F, G, H When all nodes in ripple are visited, visit nodes in next ripples 0 2 1 3

10
A H B F E D C G Overview Nodes visited: D, C, E, F, G, H, A When all nodes in ripple are visited, visit nodes in next ripples 0 2 1 3 4

11
A H B F E D C G Overview Nodes visited: D, C, E, F, G, H, A, B When all nodes in ripple are visited, visit nodes in next ripples 0 2 1 3 4

12
A H B F E D C G Walk-Through Enqueued Array A B C D E F G H How is this accomplished? Simply replace the stack with a queue! Rules: (1) Maintain an enqueued array. (2) Visit node when dequeued. Q

13
A H B F E D C G Walk-Through Enqueued Array A B C D√ E F G H Enqueue D. Notice, D not yet visited. Q D Nodes visited:

14
A H B F E D C G Walk-Through Enqueued Array A B C√ D√ E√ F√ G H Dequeue D. Visit D. Enqueue unenqueued nodes adjacent to D. Q C E F Nodes visited: D

15
A H B F E D C G Walk-Through Enqueued Array A B C√ D√ E√ F√ G H Dequeue C. Visit C. Enqueue unenqueued nodes adjacent to C. Q E F Nodes visited: D, C

16
A H B F E D C G Walk-Through Enqueued Array A B C√ D√ E√ F√ G H Dequeue E. Visit E. Enqueue unenqueued nodes adjacent to E. Q F G Nodes visited: D, C, E

17
A H B F E D C G Walk-Through Enqueued Array A B C√ D√ E√ F√ G√ H Dequeue F. Visit F. Enqueue unenqueued nodes adjacent to F. Q G Nodes visited: D, C, E, F

18
A H B F E D C G Walk-Through Enqueued Array A B C√ D√ E√ F√ G√ H√ Dequeue G. Visit G. Enqueue unenqueued nodes adjacent to G. Q H Nodes visited: D, C, E, F, G

19
A H B F E D C G Walk-Through Enqueued Array A√ B√ C√ D√ E√ F√ G√ H√ Dequeue H. Visit H. Enqueue unenqueued nodes adjacent to H. Q A B Nodes visited: D, C, E, F, G, H

20
A H B F E D C G Walk-Through Enqueued Array A√ B√ C√ D√ E√ F√ G√ H√ Dequeue A. Visit A. Enqueue unenqueued nodes adjacent to A. Q B Nodes visited: D, C, E, F, G, H, A

21
A H B F E D C G Walk-Through Enqueued Array A√ B√ C√ D√ E√ F√ G√ H√ Dequeue B. Visit B. Enqueue unenqueued nodes adjacent to B. Q empty Nodes visited: D, C, E, F, G, H, A, B

22
A H B F E D C G Walk-Through Enqueued Array A√ B√ C√ D√ E√ F√ G√ H√ Q empty. Algorithm done. Q empty Nodes visited: D, C, E, F, G, H, A, B

23
Consider Trees 1.What do we call a breadth-first traversal on trees?

Similar presentations

OK

Review Graph Directed Graph Undirected Graph Sub-Graph Spanning Sub-Graph Degree of a Vertex Weighted Graph Elementary and Simple Path Link List Representation.

Review Graph Directed Graph Undirected Graph Sub-Graph Spanning Sub-Graph Degree of a Vertex Weighted Graph Elementary and Simple Path Link List Representation.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on 4 stroke petrol engine Ppt on introduction to information security Ppt on pi in maths what is the factor Ppt on organic farming vs chemical farming Ppt on the origin of the universe Ppt on computer malware software Seminar ppt on blue brain Convert word doc to ppt online shopping Ppt on needle stick injury prevention Ppt on solar power plant