Scribd
Upload
30 views

A B D C: Front

The document demonstrates how breadth-first search algorithm works by traversing a graph from a source node. It uses a FIFO queue to keep track of nodes to visit at each level. It starts by adding the source node to the queue, then repeatedly dequeues nodes and enqueues their unvisited neighbors until the queue is empty, marking each visited node.

Uploaded by

suprems006
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
30 views

A B D C: Front

The document demonstrates how breadth-first search algorithm works by traversing a graph from a source node. It uses a FIFO queue to keep track of nodes to visit at each level. It starts by adding the source node to the queue, then repeatedly dequeues nodes and enqueues their unvisited neighbors until the queue is empty, marking each visited node.

Uploaded by

suprems006
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 50

Breadth First Search

A B
F
I
E H
D C
G

FIFO Queue
-
front
Breadth First Search
A B
F
I
E H
D C
G
A
FIFO Queue
-
front
enqueue source node
Breadth First Search
A B
F
I
E H
D C
G
A
FIFO Queue
-
front
dequeue next vertex
Breadth First Search
front
visit neighbors of A
A B
F
I
E H
D C
G
-
FIFO Queue
Breadth First Search

front
visit neighbors of A
A B
F
I
E H
D C
G
-
FIFO Queue
Breadth First Search
B
front
B discovered
A B
F
I
E H
D C
G
- A
FIFO Queue
Breadth First Search
B
front
visit neighbors of A
A
F
I
E H
D C
G
-
B
A
FIFO Queue
Breadth First Search
B I
front
I discovered
A
F
I
E H
D C
G
-
B
A
A
FIFO Queue
Breadth First Search
B I
front
finished with A
A
F
I
E H
D C
G
-
B
A
A
FIFO Queue
Breadth First Search
B I
front
F
I
E H
D C
G
-
B
A
A
dequeue next vertex
FIFO Queue
A
Breadth First Search
I
front
F
I
E H
D C
G
-
B
A
A
visit neighbors of B
FIFO Queue
A
Breadth First Search
I
front
F
I
E H
D C
G
-
B
A
A
visit neighbors of B
FIFO Queue
A
Breadth First Search
I F
front
F
I
E H
D C
G
-
B
A
A
F discovered
B
FIFO Queue
A
Breadth First Search
I F
front
F
I
E H
D C
G
-
B
A
A
visit neighbors of B
B
FIFO Queue
A
Breadth First Search
I F
front
F
I
E H
D C
G
-
B
A
A
A already discovered
B
FIFO Queue
A
Breadth First Search
I F
front
F
I
E H
D C
G
-
B
A
A
finished with B
B
FIFO Queue
A
Breadth First Search
I F
front
F
I
E H
D C
G
- A
A
dequeue next vertex
B
FIFO Queue
B A
Breadth First Search
F
front
F
I
E H
D C
G
- A
A
visit neighbors of I
B
FIFO Queue
B A
Breadth First Search
F
front
F
I
E H
D C
G
- A
A
visit neighbors of I
B
FIFO Queue
B A
Breadth First Search
F
front
F
I
E H
D C
G
- A
A
A already discovered
B
FIFO Queue
B A
Breadth First Search
F
front
F
I
E H
D C
G
- A
A
visit neighbors of I
B
FIFO Queue
B A
Breadth First Search
F E
front
F
I
E H
D C
G
- A
A
E discovered
B I
FIFO Queue
B A
Breadth First Search
F E
front
F
I
E H
D C
G
- A
A
visit neighbors of I
B I
FIFO Queue
B A
Breadth First Search
F E
front
F
I
E H
D C
G
- A
A
F already discovered
B I
FIFO Queue
B A
Breadth First Search
F E
front
F
I
E H
D C
G
- A
A
I finished
B I
FIFO Queue
B A
Breadth First Search
F E
front
F E H
D C
G
- A
A
dequeue next vertex
B I
FIFO Queue
B A
I
Breadth First Search
E
front
F E H
D C
G
- A
A
visit neighbors of F
B I
FIFO Queue
B A
I
Breadth First Search
E G
front
F E H
D C
G
- A
A
G discovered
B I F
FIFO Queue
B A
I
Breadth First Search
E G
front
F E H
D C
G
- A
A
F finished
B I F
FIFO Queue
B A
I
Breadth First Search
E G
front
E H
D C
G
- A
A
dequeue next vertex
B I F
FIFO Queue
I
F
B A
Breadth First Search
G
front
E H
D C
G
- A
A
visit neighbors of E
B I F
FIFO Queue
I
F
B A
Breadth First Search
G
front
H
D C
G
- A
A
E finished
B I F
FIFO Queue
I
F
B A
E
Breadth First Search
G
front
H
D C
G
- A
A
dequeue next vertex
B I F
FIFO Queue
I
F
B A
E
Breadth First Search
front
H
D C
G
- A
A
visit neighbors of G
B I F
FIFO Queue
I
F
B A
E
Breadth First Search
C
front
H
D C
G
- A
A
C discovered
B I F
G
FIFO Queue
I
F
B A
E
Breadth First Search
C
front
H
D C
G
- A
A
visit neighbors of G
B I F
G
FIFO Queue
I
F
B A
E
Breadth First Search
C H
front
H
D C
G
- A
A
H discovered
B I F
G
G
FIFO Queue
I
F
B A
E
Breadth First Search
C H
front
H
D C
G
- A
A
G finished
B I F
G
G
FIFO Queue
I
F
B A
E
Breadth First Search
C H
front
H
D C
- A
A
dequeue next vertex
B I F
G
G
FIFO Queue
I
F
B A
E G
Breadth First Search
H
front
H
D C
- A
A
visit neighbors of C
B I F
G
G
FIFO Queue
I
F
B A
E G
Breadth First Search
H D
front
H
D C
- A
A
D discovered
B I F
G
G
C
FIFO Queue
I
F
B A
E G
Breadth First Search
H D
front
H
D C
- A
A
C finished
B I F
G
G
C
FIFO Queue
I
F
B A
E G
Breadth First Search
H D
front
H
D
- A
A
get next vertex
B I F
G
G
C
FIFO Queue
I
F
B A
E G
C
Breadth First Search
D
front
H
D
- A
A
visit neighbors of H
B I F
G
G
C
FIFO Queue
I
F
B A
E G
C
Breadth First Search
D
front
D
- A
A
finished H
B I F
G
G
C
FIFO Queue
I
F
B A
E G H
C
Breadth First Search
D
front
D
- A
A
dequeue next vertex
B I F
G
G
C
FIFO Queue
I
F
B A
E G H
C
Breadth First Search

front
D
- A
A
visit neighbors of D
B I F
G
G
C
FIFO Queue
I
F
B A
E G H
C
Breadth First Search

front
- A
A
D finished
B I F
G
G
C
FIFO Queue
I
F
B A
E G H
C D
Breadth First Search

front
- A
A
dequeue next vertex
B I F
G
G
C
FIFO Queue
I
F
B A
E G H
C D
Breadth First Search

front
STOP
E H
D
- A
A
B I F
G
G
C
FIFO Queue
I
F
B A
G
C

You might also like