Breadth First Search

Post on 31-Dec-2015

24 views 0 download

Tags:

description

Breadth First Search. 2. 4. 8. s. 5. 7. 3. 6. 9. Breadth First Search. Shortest path from s. 1. 2. 2. 4. 8. 0. s. 5. 7. 3. 6. 9. Undiscovered. Queue: s. Discovered. Top of queue. Finished. Breadth First Search. 1. 2. 4. 8. 0. s. 5. 7. 3. 3. 6. 9. 1. - PowerPoint PPT Presentation

Transcript of Breadth First Search

1

Breadth First Search

s

2

5

4

7

8

3 6 9

2

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: s

Top of queue

2

1Shortest pathfrom s

3

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: s 2

Top of queue

3

1

1

4

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: s 2 3

Top of queue

5

1

1

1

5

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 2 3 5

Top of queue

1

1

1

6

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 2 3 5

Top of queue

4

1

1

1

2

7

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 2 3 5 4

Top of queue

1

1

1

2

5 already discovered:don't enqueue

8

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 2 3 5 4

Top of queue

1

1

1

2

9

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 3 5 4

Top of queue

1

1

1

2

10

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 3 5 4

Top of queue

1

1

1

2

6

2

11

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 3 5 4 6

Top of queue

1

1

1

2

2

12

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 5 4 6

Top of queue

1

1

1

2

2

13

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 5 4 6

Top of queue

1

1

1

2

2

14

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 4 6

Top of queue

1

1

1

2

2

15

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 4 6

Top of queue

1

1

1

2

2

8

3

16

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 4 6 8

Top of queue

1

1

1

2

2

3

17

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 6 8

Top of queue

1

1

1

2

2

3

7

3

18

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 6 8 7

Top of queue

1

1

1

2

2

3

9

3

3

19

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 6 8 7 9

Top of queue

1

1

1

2

2

3

3

3

20

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 8 7 9

Top of queue

1

1

1

2

2

3

3

3

21

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 7 9

Top of queue

1

1

1

2

2

3

3

3

22

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 7 9

Top of queue

1

1

1

2

2

3

3

3

23

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 7 9

Top of queue

1

1

1

2

2

3

3

3

24

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 7 9

Top of queue

1

1

1

2

2

3

3

3

25

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 9

Top of queue

1

1

1

2

2

3

3

3

26

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 9

Top of queue

1

1

1

2

2

3

3

3

27

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue: 9

Top of queue

1

1

1

2

2

3

3

3

28

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Undiscovered

Discovered

Finished

Queue:

Top of queue

1

1

1

2

2

3

3

3

29

Breadth First Search

s

2

5

4

7

8

3 6 9

0

Level Graph

1

1

1

2

2

3

3

3