breadth first search

Breadth First Search

A B

F

I

E H

DC

G

FIFO Queue

-

front

Breadth First Search

A B

F

I

E H

DC

G

A

FIFO Queue

-

frontenqueue source node

Breadth First Search

A B

F

I

E H

DC

G

A

FIFO Queue

-

frontdequeue next vertex

Breadth First Search

frontvisit neighbors of A

A B

F

I

E H

DC

G

-

FIFO Queue

Breadth First Search

frontvisit neighbors of A

A B

F

I

E H

DC

G

-

FIFO Queue

Breadth First Search

BfrontB discovered

A B

F

I

E H

DC

G

- A

FIFO Queue

Breadth First Search

B frontvisit neighbors of A

A

F

I

E H

DC

G

-

B

A

FIFO Queue

Breadth First Search

B I frontI discovered

A

F

I

E H

DC

G

-

B

A

A

FIFO Queue

Breadth First Search

B I frontfinished with A

A

F

I

E H

DC

G

-

B

A

A

FIFO Queue

Breadth First Search

B I front

F

I

E H

DC

G

-

B

A

A

dequeue next vertex

FIFO Queue

A

Breadth First Search

I front

F

I

E H

DC

G

-

B

A

A

visit neighbors of B

FIFO Queue

A

Breadth First Search

I front

F

I

E H

DC

G

-

B

A

A

visit neighbors of B

FIFO Queue

A

Breadth First Search

I F front

F

I

E H

DC

G

-

B

A

A

F discovered

B

FIFO Queue

A

Breadth First Search

I F front

F

I

E H

DC

G

-

B

A

A

visit neighbors of B

B

FIFO Queue

A

Breadth First Search

I F front

F

I

E H

DC

G

-

B

A

A

A already discovered

B

FIFO Queue

A

Breadth First Search

I F front

F

I

E H

DC

G

-

B

A

A

finished with B

B

FIFO Queue

A

Breadth First Search

I F front

F

I

E H

DC

G

- A

A

dequeue next vertex

B

FIFO Queue

BA

Breadth First Search

F front

F

I

E H

DC

G

- A

A

visit neighbors of I

B

FIFO Queue

BA

Breadth First Search

F front

F

I

E H

DC

G

- A

A

visit neighbors of I

B

FIFO Queue

BA

Breadth First Search

F front

F

I

E H

DC

G

- A

A

A already discovered

B

FIFO Queue

BA

Breadth First Search

F front

F

I

E H

DC

G

- A

A

visit neighbors of I

B

FIFO Queue

BA

Breadth First Search

F E front

F

I

E H

DC

G

- A

A

E discovered

BI

FIFO Queue

BA

Breadth First Search

F E front

F

I

E H

DC

G

- A

A

visit neighbors of I

BI

FIFO Queue

BA

Breadth First Search

F E front

F

I

E H

DC

G

- A

A

F already discovered

BI

FIFO Queue

BA

Breadth First Search

F E front

F

I

E H

DC

G

- A

A

I finished

BI

FIFO Queue

BA

Breadth First Search

F E front

FE H

DC

G

- A

A

dequeue next vertex

BI

FIFO Queue

BA

I

Breadth First Search

E front

FE H

DC

G

- A

A

visit neighbors of F

BI

FIFO Queue

BA

I

Breadth First Search

E G front

FE H

DC

G

- A

A

G discovered

BI F

FIFO Queue

BA

I

Breadth First Search

E G front

FE H

DC

G

- A

A

F finished

BI F

FIFO Queue

BA

I

Breadth First Search

E G front

E H

DC

G

- A

A

dequeue next vertex

BI F

FIFO Queue

I

F

BA

Breadth First Search

G front

E H

DC

G

- A

A

visit neighbors of E

BI F

FIFO Queue

I

F

BA

Breadth First Search

G front

H

DC

G

- A

A

E finished

BI F

FIFO Queue

I

F

BA

E

Breadth First Search

G front

H

DC

G

- A

A

dequeue next vertex

BI F

FIFO Queue

I

F

BA

E

Breadth First Search

front

H

DC

G

- A

A

visit neighbors of G

BI F

FIFO Queue

I

F

BA

E

Breadth First Search

Cfront

H

DC

G

- A

A

C discovered

BI F

G

FIFO Queue

I

F

BA

E

Breadth First Search

Cfront

H

DC

G

- A

A

visit neighbors of G

BI F

G

FIFO Queue

I

F

BA

E

Breadth First Search

C Hfront

H

DC

G

- A

A

H discovered

BI F

G

G

FIFO Queue

I

F

BA

E

Breadth First Search

C Hfront

H

DC

G

- A

A

G finished

BI F

G

G

FIFO Queue

I

F

BA

E

Breadth First Search

C Hfront

H

DC

- A

A

dequeue next vertex

BI F

G

G

FIFO Queue

I

F

BA

E G

Breadth First Search

Hfront

H

DC

- A

A

visit neighbors of C

BI F

G

G

FIFO Queue

I

F

BA

E G

Breadth First Search

H Dfront

H

DC

- A

A

D discovered

BI F

G

G

C

FIFO Queue

I

F

BA

E G

Breadth First Search

H Dfront

H

DC

- A

A

C finished

BI F

G

G

C

FIFO Queue

I

F

BA

E G

Breadth First Search

H Dfront

H

D

- A

A

get next vertex

BI F

G

G

C

FIFO Queue

I

F

BA

E G

C

Breadth First Search

Dfront

H

D

- A

A

visit neighbors of H

BI F

G

G

C

FIFO Queue

I

F

BA

E G

C

Breadth First Search

Dfront

D

- A

A

finished H

BI F

G

G

C

FIFO Queue

I

F

BA

E G H

C

Breadth First Search

Dfront

D

- A

A

dequeue next vertex

BI F

G

G

C

FIFO Queue

I

F

BA

E G H

C

Breadth First Search

front

D

- A

A

visit neighbors of D

BI F

G

G

C

FIFO Queue

I

F

BA

E G H

C

Breadth First Search

front

- A

A

D finished

BI F

G

G

C

FIFO Queue

I

F

BA

E G H

C D

Breadth First Search

front

- A

A

dequeue next vertex

BI F

G

G

C

FIFO Queue

I

F

BA

E G H

C D

Breadth First Search

frontSTOP

E H

D

- A

A

BI F

G

G

C

FIFO Queue

I

F

BA

G

C