Scribd
Upload
10 views

Breadth First Search (BFS)

This document discusses graph search algorithms Breadth First Search (BFS) and Depth First Search (DFS). It explains how BFS works by exploring the neighbors of a starting node first before moving to neighbors of neighbors. DFS explores as far as possible along each branch before backtracking. The document also covers enhancing BFS to record paths, distances, and complexity. It describes implementing and analyzing complexity of DFS and applications of BFS and DFS such as identifying connected components and detecting cycles.

Uploaded by

himadeepthi sayani
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
10 views

Breadth First Search (BFS)

This document discusses graph search algorithms Breadth First Search (BFS) and Depth First Search (DFS). It explains how BFS works by exploring the neighbors of a starting node first before moving to neighbors of neighbors. DFS explores as far as possible along each branch before backtracking. The document also covers enhancing BFS to record paths, distances, and complexity. It describes implementing and analyzing complexity of DFS and applications of BFS and DFS such as identifying connected components and detecting cycles.

Uploaded by

himadeepthi sayani
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 39

Breadth First Search (BFS)

Reachability in a graph
Breadth First Search (BFS)
Breadth First Search (BFS)
Breadth First Search (BFS)
Breadth First Search (BFS)
Breadth First Search (BFS)
BFS from vertex 7
BFS from vertex 7
Complexity of BFS
Complexity of BFS
Enhancing BFS to record paths
Enhancing BFS to record paths
Enhancing BFS to record paths
Enhancing BFS to record distance
Enhancing BFS to record distance
Enhancing BFS to record distance
Summary
Depth First Search (DFS)
Depth First Search (DFS)
DFS
DFS
Implementing DFS
Use an Adjacency List
Complexity of DFS
Summary
Applications of BFS and
DFS
BFS and DFS
Identifying Connecting Components
Identifying Connecting Components
Identifying Connecting Components
Detecting Cycle
BFS Tree
DFS Tree
DFS Tree
Directed Cycles
Classifying non-tree in directed graphs
Connectivity in directed graphs

You might also like