Scribd
Upload
3 views

BFS Graphs

The document outlines the Breadth First Search (BFS) algorithm, detailing the process of traversing a graph using a FIFO queue. It describes the steps of enqueuing and dequeuing nodes, visiting neighbors, and discovering new nodes until all reachable nodes are processed. The output at each step shows the order in which nodes are visited, culminating in the final output of the traversal.

Uploaded by

thefreestyler07
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
3 views

BFS Graphs

The document outlines the Breadth First Search (BFS) algorithm, detailing the process of traversing a graph using a FIFO queue. It describes the steps of enqueuing and dequeuing nodes, visiting neighbors, and discovering new nodes until all reachable nodes are processed. The output at each step shows the order in which nodes are visited, culminating in the final output of the traversal.

Uploaded by

thefreestyler07
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 C D

E F G H

Output :
I

front

FIFO Queue
Breadth First Search

-
A B C D

E F G H

Output :
I

enqueue source node front A


FIFO Queue
Breadth First Search

-
A B C D

E F G H

Output : A
I

dequeue next vertex front A


FIFO Queue
Breadth First Search

-
A B C D

E F G H

Output : A
I

visit neighbors of A front

FIFO Queue
Breadth First Search

-
A B C D

E F G H

Output : A
I

visit neighbors of A front

FIFO Queue
Breadth First Search

- A
A B C D

E F G H

Output : A
I

B discovered front B
FIFO Queue
Breadth First Search

- A
A B C D

E F G H

Output : A
I

visit neighbors of A front B


FIFO Queue
Breadth First Search

- A
A B C D

E F G H

Output : A
I

I discovered front B I
FIFO Queue
Breadth First Search

- A
A B C D

E F G H

Output : A
I

finished with A front B I


FIFO Queue
Breadth First Search

- A
A B C D

E F G H

Output : A B
I

dequeue next vertex front B I


FIFO Queue
Breadth First Search

- A
A B C D

E F G H

Output : A B
I

visit neighbors of B front I


FIFO Queue
Breadth First Search

- A
A B C D

E F G H

Output : A B
I

visit neighbors of B front I


FIFO Queue
Breadth First Search

- A
A B C D

E F G H

Output : A B
I

F discovered front I F
FIFO Queue
Breadth First Search

- A
A B C D

E F G H

Output : A B
I

visit neighbors of B front I F


FIFO Queue
Breadth First Search

- A
A B C D

E F G H

Output : A B
I

A already discovered front I F


FIFO Queue
Breadth First Search

- A
A B C D

E F G H

Output : A B
I

finished with B front I F


FIFO Queue
Breadth First Search

- A
A B C D

E F G H

Output : A B I
I

dequeue next vertex front I F


FIFO Queue
Breadth First Search

- A
A B C D

E F G H

Output : A B I
I

visit neighbors of I front F


FIFO Queue
Breadth First Search

- A
A B C D

E F G H

Output : A B I
I

visit neighbors of I front F


FIFO Queue
Breadth First Search

- A
A B C D

E F G H

Output : A B I
I

A already discovered front F


FIFO Queue
Breadth First Search

- A
A B C D

E F G H

Output : A B I
I

visit neighbors of I front F


FIFO Queue
Breadth First Search

- A
A B C D

E F G H

I B

Output : A B I
I

E discovered front F E
FIFO Queue
Breadth First Search

- A
A B C D

E F G H

I B

Output : A B I
I

visit neighbors of I front F E


FIFO Queue
Breadth First Search

- A
A B C D

E F G H

I B

Output : A B I
I

F already discovered front F E


FIFO Queue
Breadth First Search

- A
A B C D

E F G H

I B

Output : A B I
I

I finished front F E
FIFO Queue
Breadth First Search

- A
A B C D

E F G H

I B

Output : A B I F
I

dequeue next vertex front F E


FIFO Queue
Breadth First Search

- A
A B C D

E F G H

I B

Output : A B I F
I

visit neighbors of F front E


FIFO Queue
Breadth First Search

- A
A B C D

E F G H

I B F

Output : A B I F
I

G discovered front E G
FIFO Queue
Breadth First Search

- A
A B C D

E F G H

I B F

Output : A B I F
I

F finished front E G
FIFO Queue
Breadth First Search

- A
A B C D

E F G H

I B F

Output : A B I F E
I

dequeue next vertex front E G


FIFO Queue
Breadth First Search

- A
A B C D

E F G H

I B F

Output : A B I F E
I

visit neighbors of E front G


FIFO Queue
Breadth First Search

- A
A B C D

E F G H

I B F

Output : A B I F E
I

E finished front G
FIFO Queue
Breadth First Search

- A
A B C D

E F G H

I B F

Output : A B I F E G
I

dequeue next vertex front G


FIFO Queue
Breadth First Search

- A
A B C D

E F G H

I B F

Output : A B I F E G
I

visit neighbors of G front

FIFO Queue
Breadth First Search

- A G
A B C D

E F G H

I B F

Output : A B I F E G
I

C discovered front C
FIFO Queue
Breadth First Search

- A G
A B C D

E F G H

I B F

Output : A B I F E G
I

visit neighbors of G front C


FIFO Queue
Breadth First Search

- A G
A B C D

E F G H

I B F G

Output : A B I F E G
I

H discovered front C H
FIFO Queue
Breadth First Search

- A G
A B C D

E F G H

I B F G

Output : A B I F E G
I

G finished front C H
FIFO Queue
Breadth First Search

- A G
A B C D

E F G H

I B F G

Output : A B I F E G C
I

dequeue next vertex front C H


FIFO Queue
Breadth First Search

- A G
A B C D

E F G H

I B F G

Output : A B I F E G C
I

visit neighbors of C front H


FIFO Queue
Breadth First Search

- A G C
A B C D

E F G H

I B F G

Output : A B I F E G C
I

D discovered front H D
FIFO Queue
Breadth First Search

- A G C
A B C D

E F G H

I B F G

Output : A B I F E G C
I

C finished front H D
FIFO Queue
Breadth First Search

- A G C
A B C D

E F G H

I B F G

Output : A B I F E G C H
I

get next vertex front H D


FIFO Queue
Breadth First Search

- A G C
A B C D

E F G H

I B F G

Output : A B I F E G C H
I

visit neighbors of H front D


FIFO Queue
Breadth First Search

- A G C
A B C D

E F G H

I B F G

Output : A B I F E G C H
I

finished H front D
FIFO Queue
Breadth First Search

- A G C
A B C D

E F G H

I B F G

Output : A B I F E G C H D
I

dequeue next vertex front D


FIFO Queue
Breadth First Search

- A G C
A B C D

E F G H

I B F G

Output : A B I F E G C H D
I

visit neighbors of D front

FIFO Queue
Breadth First Search

- A G C
A B C D

E F G H

I B F G

Output : A B I F E G C H D
I

D finished front

FIFO Queue
Breadth First Search

- A G C
A B C D

E F G H

I B F G

Output : A B I F E G C H D
I

dequeue next vertex front

FIFO Queue
Breadth First Search

- A G C
A B C D

E F G H

I B F G

Output : A B I F E G C H D
I

STOP front

FIFO Queue

You might also like