Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Topological Sort
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
1
Intro
2
Directed Acyclic Graphs (DAGs)
3
Kahn's Algorithm - The Intuition
4
Kahn's Algorithm - Implementation
5
Detecting Cycles with Kahn's
6
Quiz: Cycle Detection with Kahn's
7
Problem - Course Schedule II
8
Course Schedule II - The Constraint
9
Course Schedule II - Core Idea
10
Course Schedule II - Algorithm
11
Course Schedule II - Implementation
12
Lessons from Course Schedule II
13
DFS-Based Topological Sort
14
Comparing Kahn and DFS
15
Quiz: Kahn's vs DFS Topological Sort
16
Common Topological Sort Mistakes
17
Pattern - Lexicographical Order
18
Pattern - Uniqueness
19
Pattern - Implicit Graphs
20
Dynamic Programming on DAGs
21
Quiz: DAG Properties
22
Problem - Longest Flight Route
23
Longest Flight Route - Core Idea
24
Longest Flight Route - Algorithm
25
Longest Flight Route - Implementation
26
Pattern - Reverse Logic
27
Lessons from Longest Flight Route
28
Quiz: DP on DAGs
29
Problem - Game Routes
30
Game Routes - Core Idea
31
Game Routes - Algorithm
32
Game Routes - Implementation
33
Lessons from Game Routes
34
Quiz: Counting Paths in a DAG
35
Problem - Parallel Courses III
36
Parallel Courses III - Core Idea
37
Parallel Courses III - Algorithm
38
Parallel Courses III - Implementation
39
Lessons from Parallel Courses III
40
Quiz: Parallel Scheduling
41
Section Recap
DP on DAGs
0/50
Mixed Practice: Graph Traversals
0/35
Strongly Connected Components
0/45
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
15.1
Intro
2 minutes
100%
Tasks
Read Unit