Breadth-First
Search
CMSC 204 - GROUP 3
GROUP MEMBERS
LYX DILLA
CHARLES MALABANAN
VINCE TAMIS
What is Artificial Intelligence?
Breadth First Search (BFS)
As the name BFS suggests, you are required to traverse the graph breadthwise as follows:
1. First move horizontally and visit all the nodes of the current layer
2. Move to the next layer
Traversing process
Traversing process
Traversing process
Traversing process
How BFS Supports Data Analysis
Level-based classification of data
Detects shortest paths in unweighted graphs
Enables structured, layer-by-layer data exploration
Useful for clustering, route mapping, and
relationship analysis in AI
How BFS Supports Data Analysis
BFS traversal
across levels (e.g.,
Layer 0 → Layer 1
→ Layer 2)
Real-World Applications of BFS in AI
Social Network Analysis
Trace influence, connections & community layers
Recommendation Systems
Discover related items/users through graph traversal
Chatbot Logic Flows
Navigate dialogue trees and user queries efficiently
Why BFS is Efficient for Data Analysis
Time Complexity: O(V + E)
Scales well with large graphs
Guarantees shortest path (unweighted graphs)
BFS vs DFS: BFS = level-wise | DFS = depth-first
BFS vs DFS path difference
Comparison chart comparing
performance or efficiency
BFS in AI: A Smart Step in Data Decisions
AI needs structured algorithms for smart
decisions
BFS brings logic, clarity, and efficiency
Future AI = more adaptive, more data-driven
Any questions?
DEMO
Conclusion
Thank You
F O R Y O U R A T T E N T I O N