Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Learn widely used algorithms
·
Module 5
Graph Traversal Techniques
1
Graph Representations: Adjacency Matrix vs. Adjacency List
Compare adjacency matrix and adjacency list representations for graphs and their trade-offs.
2
BFS for Shortest Paths in Unweighted Graphs
Implement and analyze breadth-first search (BFS) to find shortest paths in unweighted graphs.
3
Graph Traversal: Depth-First Search (DFS)
Implement and analyze depth-first search (DFS) on a graph.
4
Cycle Detection with BFS/DFS
Apply BFS or DFS to detect cycles in both directed and undirected graphs.
Previous module
Greedy and Divide & Conquer Strategies
Next module
Shortest Path & MST Algorithms