breadth first search algorithm

18
1 v 1 Breadth First Search Algorithm: Example BFS Tree: T = {} v 2 v 3 v 6 v 5 v 4 v 7 v 1 Layers: L0={} i=0

Upload: cagatay-yuksel

Post on 04-Jun-2015

1.507 views

Category:

Education


2 download

DESCRIPTION

Demonstration of Breadth First Search Algorithm by an example

TRANSCRIPT

Page 1: Breadth First Search Algorithm

1

v1

Breadth First Search Algorithm: Example

BFS Tree: T = {}

v2 v3

v6 v5 v4

v7 v1

Layers: L0={}

i=0

Page 2: Breadth First Search Algorithm

2

v1

Breadth First Search Algorithm: Example

BFS Tree: T = {}

v2 v3

v6 v5 v4

v7 v1

Layers: L0={v1}},

i=1

Page 3: Breadth First Search Algorithm

3

v1

Breadth First Search Algorithm: Example

BFS Tree: T = {(1,4),(1,5),}

v2 v3

v6 v5 v4

v7 v1

Layers: L0={v1}, L1={v4,v5},

i=1

Page 4: Breadth First Search Algorithm

4

v1

Breadth First Search Algorithm: Example

BFS Tree: T = {(1,4), (1,5), (4,3), (5,2),(5,6),(5,7) }

v2 v3

v6 v5 v4

v7 v1

Layers: L0={v1}, L1={v4,v5}, L2={v3,v2,v6,v7}

i=2

Page 5: Breadth First Search Algorithm

5

Breadth First Search Algorithm: Example

BFS Tree: T = {(1,4), (1,5), (4,3), (5,2),(5,6),(5,7) }

v2

v3 v6

v5v4

v7

v1

Layers: L0={v1}, L1={v4,v5}, L2={v3,v2,v6,v7}

i=2

Page 6: Breadth First Search Algorithm

6

Page 7: Breadth First Search Algorithm

7

v1

Depth First Search Algorithm: Example

DFS Tree: T= {}

v2 v3

v6 v5 v4

v7 v1

Stack: {v1}

Page 8: Breadth First Search Algorithm

8

v1

Depth First Search Algorithm: Example

DFS Discovered Order: T= {v1,}

v2 v3

v6 v5 v4

v7

Stack: {v4,v5}

Page 9: Breadth First Search Algorithm

9

Depth First Search Algorithm: Example

v2 v3

v6 v5 v4

v7 v1

Stack: {v4,v2,v3,v6,v7}

DFS Discovered Order: T= {v1,v5}

Page 10: Breadth First Search Algorithm

10

v1

Depth First Search Algorithm: Example

DFS Discovered Order: T= {v1,v5}

v2 v3

v6 v5 v4

v7 v1

Stack: {v4,v2,v3,v6,v7}

Page 11: Breadth First Search Algorithm

11

v1

Depth First Search Algorithm: Example

DFS Tree: T= { (v1,v5) }

v2 v3

v6 v5 v4

v7 v1

Stack: {v4,v2,v3,v6}

Page 12: Breadth First Search Algorithm

12

v1

Depth First Search Algorithm: Example

DFS Tree: T= { (v1,v5) }

v2 v3

v6 v5 v4

v7 v1

Stack: {v4,v2,v3,v2}

Page 13: Breadth First Search Algorithm

13

v1

Depth First Search Algorithm: Example

DFS Tree: T= { (v1,v5) }

v2 v3

v6 v5 v4

v7 v1

Stack: {v4,v2,v3}

Page 14: Breadth First Search Algorithm

14

v1

Depth First Search Algorithm: Example

DFS Tree: T= { (v1,v5) }

v2 v3

v6 v5 v4

v7 v1

Stack: {v4,v2,v4}

Page 15: Breadth First Search Algorithm

15

v1

Depth First Search Algorithm: Example

DFS Tree: T= { (v1,v5) }

v2 v3

v6 v5 v4

v7 v1

Stack: {v4,v2}

Page 16: Breadth First Search Algorithm

16

v1

Depth First Search Algorithm: Example

DFS Tree: T= { (v1,v5) }

v2 v3

v6 v5 v4

v7 v1

Stack: {v4}

Page 17: Breadth First Search Algorithm

17

v1

Depth First Search Algorithm: Example

DFS Tree: T= { (v1,v5) }

v2 v3

v6 v5 v4

v7 v1

Stack: {}

Page 18: Breadth First Search Algorithm

18

Depth First Search Algorithm: Example

DFS Tree: T= { (v1,v5) }

v1

v2

v3

v6

v5

v4

v7

v1

Stack: {}