Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Strongly Connected Components
Problemset
Discussion
AI Helper
Graph Fundamentals
0/41
Depth First Search (DFS)
0/41
Breadth First Search (BFS)
0/40
Flood Fill & Grid Graphs
0/32
Bipartite Graphs
0/48
Tree Fundamentals
0/44
Tree Diameter & Center
0/45
Subtree DP
0/44
Floyd-Warshall Algorithm
0/41
Dijkstra's Algorithm
0/40
Bellman-Ford Algorithm
0/48
Mixed Practice - Shortest Paths
0/36
Disjoint Set Union (DSU)
0/49
Minimum Spanning Trees
0/48
Topological Sort
0/41
DP on DAGs
0/50
Mixed Practice: Graph Traversals
0/35
Strongly Connected Components
0/45
1
Intro
2
What is an SCC?
3
Why Find SCCs?
4
Kosaraju's Algorithm - Intuition
5
Kosaraju's Algorithm - Steps
6
Kosaraju Example
7
Kosaraju - Implementation
8
Quiz: Kosaraju's First DFS
9
Tarjan's Algorithm - Intuition
10
Tarjan's Algorithm - Steps
11
Tarjan Example
12
Tarjan - Implementation
13
Kosaraju vs Tarjan
14
Quiz: Tarjan's Low-Link Values
15
The Condensation Graph
16
Building the Condensation Graph
17
Application: Dependency Analysis
18
Application: 2-SAT Connection
19
Quiz: Condensation Graph
20
Problem - Planets and Kingdoms (CSES 1683)
21
Planets and Kingdoms - Approach
22
Planets and Kingdoms - Implementation
23
Problem - Coin Collector (CSES 1686)
24
Coin Collector - Approach
25
Coin Collector - Implementation
26
Problem - Flight Routes Check (CSES 1682)
27
Flight Routes Check - Approach
28
Flight Routes Check - Implementation
29
Quiz: SCC Problem Solving
30
Edge Cases for SCC Problems
31
Common SCC Mistakes
32
SCC in Undirected Graphs?
33
When to Use SCC
34
Practice Problem 1
35
Practice Problem 2
36
Practice Problem 3
37
SCC and Bridges/Articulation Points
38
SCC in Real-World Graphs
39
Time Complexity Summary
40
Space Complexity Summary
41
SCC and Cycle Detection
42
SCC and Topological Sort
43
Quiz: SCC and Cycle Detection
44
SCC Templates
45
Section Recap
2-SAT
0/51
Mixed Practice: Connectivity & MST
0/35
Rerooting Technique
0/39
Euler Tour Technique
0/51
Mixed Practice: Tree Fundamentals
0/29
Binary Lifting
0/50
Lowest Common Ancestor (LCA)
0/51
Games on Graphs
0/62
Heavy-Light Decomposition
0/49
Centroid Decomposition
0/55
Small-to-Large Merging
0/40
Functional Graphs
0/47
Mixed Practice: Advanced Tree Techniques
0/36
Bridges and Articulation Points
0/58
Network Flow
0/54
Maximum Bipartite Matching
0/50
Minimum Cut
0/47
Euler Paths and Circuits
0/37
Mixed Practice: Advanced Graphs
0/24
18.1
Intro
3 minutes
100%
Tasks
Read Unit