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.
Data Structures and Algorithms
·
Module 12
Advanced Graph Concepts and Problems
1
Cycle Detection in Undirected Graphs with DFS
Detect cycles in undirected graphs using DFS.
2
Cycle Detection in Directed Graphs using DFS
Detect cycles in directed graphs using DFS.
3
Topological Sort: DFS & Kahn's Algorithm
Perform topological sorting on a Directed Acyclic Graph (DAG) using both DFS and Kahn's algorithm (BFS).
4
Implementing Union-Find
Implement the Union-Find data structure with path compression and union by rank/size.
5
Union-Find for Graph Connectivity
Apply Union-Find to efficiently solve graph connectivity problems (e.g., number of connected components).
End of course,
Back to course
Previous module
Graph Traversal Algorithms
Next module