Scribd
Upload
75 views40 pages

Graph Traversal: BFS: Breadth First Search

The document describes breadth-first search (BFS) traversal of a graph. BFS begins at a starting node and explores all neighboring nodes. It explores neighboring nodes level-by-level, exploring all nodes at the present depth prior to moving to the next depth level. The document shows the BFS traversal from node A to node J in a sample graph, with the queue and path recorded at each step.

Uploaded by

Ridwne Hassan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
75 views40 pages

Graph Traversal: BFS: Breadth First Search

The document describes breadth-first search (BFS) traversal of a graph. BFS begins at a starting node and explores all neighboring nodes. It explores neighboring nodes level-by-level, exploring all nodes at the present depth prior to moving to the next depth level. The document shows the BFS traversal from node A to node J in a sample graph, with the queue and path recorded at each step.

Uploaded by

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

Graph Traversal: BFS

Breadth First Search


A Adjacency Lists
A F C B

F B G C
C B
C F
D C
E D C J

D E F D
G
G C E
J D K
J K
HK Rana, Dept. of CSE, GUB K E G
Graph Traversal: BFS
A->J
A QUEUE ORIG

A Ø
F C B

D E G

J K
HK Rana, Dept. of CSE, GUB
Graph Traversal: BFS

A QUEUE ORIG

A Ø
F C B F A

D E G

J K
HK Rana, Dept. of CSE, GUB
Graph Traversal: BFS

A QUEUE ORIG

A Ø
F C B F A
C A

D E G

J K
HK Rana, Dept. of CSE, GUB
Graph Traversal: BFS

A QUEUE ORIG

A Ø
F C B F A
C A
B A

D E G

J K
HK Rana, Dept. of CSE, GUB
Graph Traversal: BFS

A QUEUE ORIG

A Ø
F C B F A
C A
B A
D F
D E G

J K
HK Rana, Dept. of CSE, GUB
Graph Traversal: BFS

A QUEUE ORIG

A Ø
F C B F A
C A
B A
D F
D E G

J K
HK Rana, Dept. of CSE, GUB
Graph Traversal: BFS

A QUEUE ORIG

A Ø
F C B F A
C A
B A
D F
D G B
E G

J K
HK Rana, Dept. of CSE, GUB
Graph Traversal: BFS

A QUEUE ORIG

A Ø
F C B F A
C A
B A
D F
D G B
E G

J K
HK Rana, Dept. of CSE, GUB
Graph Traversal: BFS

A QUEUE ORIG

A Ø
F C B F A
C A
B A
D F
D G B
E G
E G

J K
HK Rana, Dept. of CSE, GUB
Graph Traversal: BFS

A QUEUE ORIG

A Ø
F C B F A
C A
B A
D F
D G B
E G
E G
J E
J K
HK Rana, Dept. of CSE, GUB
Graph Traversal: BFS

A QUEUE ORIG

A Ø
F C B F A
C A
B A
D F
D G B
E G
E G
J E
J K K J
HK Rana, Dept. of CSE, GUB
Graph Traversal: BFS

A QUEUE ORIG

A Ø
F C B F A
C A
B A
D F
D G B
E G
E G
J E
J K K J
HK Rana, Dept. of CSE, GUB
Graph Traversal: BFS
Path for A->J
A QUEUE ORIG

A Ø
F C B F A
C A
B A
D F
D G B
E G
E G
J E
J K K J
HK Rana, Dept. of CSE, GUB
Graph Traversal: DFS

Depth First Search


A Adjacency Lists
A F C B

F B G C
C B
C F
D C
E D C J

D E F D
G
G C E
J D K
J K
HK Rana, Dept. of CSE, GUB K E G
Graph Traversal: DFS
A->J
A STACK ORIG

A Ø
F C B

D E G

J K
HK Rana, Dept. of CSE, GUB
Graph Traversal: DFS

A STACK ORIG

A Ø
F C B F A

D E G

J K
HK Rana, Dept. of CSE, GUB
Graph Traversal: DFS

A STACK ORIG

A Ø
F C B F A
C A

D E G

J K
HK Rana, Dept. of CSE, GUB
Graph Traversal: DFS

A STACK ORIG

A Ø
F C B F A
C A
B A

D E G

J K
HK Rana, Dept. of CSE, GUB
Graph Traversal: DFS

A STACK ORIG

A Ø
F C B F A
C A
B A
G B
D E G

J K
HK Rana, Dept. of CSE, GUB
Graph Traversal: DFS

A STACK ORIG

A Ø
F C B F A
C A
B A
G B
D E G
E G

J K
HK Rana, Dept. of CSE, GUB
Graph Traversal: DFS

A STACK ORIG

A Ø
F C B F A
C A
B A
G B
D E G
E G
D E

J K
HK Rana, Dept. of CSE, GUB
Graph Traversal: DFS

A STACK ORIG

A Ø
F C B F A
C A
B A
G B
D E G
E G
D E
J E
J K
HK Rana, Dept. of CSE, GUB
Graph Traversal: DFS

A STACK ORIG

A Ø
F C B F A
C A
B A
G B
D E G
E G
D E
J E
J K K J
HK Rana, Dept. of CSE, GUB
Graph Traversal: DFS

A STACK ORIG

A Ø
F C B F A
C A
B A
G B
D E G
E G
D E
J E
J K K J
HK Rana, Dept. of CSE, GUB
Graph Traversal: DFS

A STACK ORIG

A Ø
F C B F A
C A
B A
G B
D E G
E G
D E
J E
J K K J
HK Rana, Dept. of CSE, GUB
Graph Traversal: DFS

A STACK ORIG

A Ø
F C B F A
C A
B A
G B
D E G
E G
D E
J E
J K K J
HK Rana, Dept. of CSE, GUB
Graph Traversal: DFS

A STACK ORIG

A Ø
F C B F A
C A
B A
G B
D E G
E G
D E
J E
J K K J
HK Rana, Dept. of CSE, GUB
Graph Traversal: DFS
Path for A->J
A STACK ORIG

A Ø
F C B F A
C A
B A
G B
D E G
E G
D E
J E
J K K J
HK Rana, Dept. of CSE, GUB
Dijkstra Animated Example

HK Rana, Dept. of CSE, GUB


Dijkstra Animated Example

HK Rana, Dept. of CSE, GUB


Dijkstra Animated Example

HK Rana, Dept. of CSE, GUB


Dijkstra Animated Example

HK Rana, Dept. of CSE, GUB


Dijkstra Animated Example

HK Rana, Dept. of CSE, GUB


Dijkstra Animated Example

HK Rana, Dept. of CSE, GUB


Dijkstra Animated Example

HK Rana, Dept. of CSE, GUB


Dijkstra Animated Example

HK Rana, Dept. of CSE, GUB


Dijkstra Animated Example

HK Rana, Dept. of CSE, GUB


Dijkstra Animated Example

HK Rana, Dept. of CSE, GUB


Thanks
HK Rana, Dept. of CSE, GUB

You might also like