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 Python programming
·
Module 11
Graph Traversal Algorithms
1
Graph Representations: Adjacency Lists and Matrices
Represent graphs using adjacency lists and adjacency matrices
2
DFS: Recursive & Iterative Implementations
Implement depth-first search (DFS) for graphs, both recursively and iteratively
3
BFS for Graphs: A Queue-Based Approach
Implement breadth-first search (BFS) for graphs using a queue
4
Cycle Detection in Graphs using DFS
Detect cycles in undirected and directed graphs using DFS
5
Connected Components in Graphs
Find connected components in an undirected graph
6
Topological Sort on a DAG
Perform a topological sort on a Directed Acyclic Graph (DAG)
Previous module
Binary Search Trees
Next module
Shortest Paths and Minimum Spanning Trees