Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Functional Graphs
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
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
1
Intro
2
Function Notation
3
The Rho Shape
4
Example Graph
5
Why This Matters
6
Floyd's Algorithm
7
Floyd's Implementation
8
Finding Cycle Start
9
Why Floyd Works
10
Cycle Length
11
Problem - Linked List Cycle II
12
Core Idea - Two-Phase Approach
13
Core Idea - Null Pointer Check
14
Linked List Cycle II - Implementation
15
Linked List Cycle II - Walkthrough
16
Linked List Cycle II - Lessons
17
Binary Lifting for Successors
18
Preprocessing Table
19
Query Processing
20
Problem - Planets Queries I
21
Core Idea - Preprocessing Once
22
Core Idea - Binary Representation
23
Planets Queries I - Implementation
24
Planets Queries I - Walkthrough
25
Planets Queries I - Lessons
26
Quiz: Functional Graph Distances
27
Tail vs Cycle Position
28
Precomputing Cycle Info
29
Distance Query Cases
30
Problem - Planets Queries II
31
Core Idea - Cycle Membership
32
Core Idea - Distance to Cycle
33
Core Idea - Cycle Position Index
34
Planets Queries II - Walkthrough
35
Planets Queries II - Lessons
36
Problem - Planet Cycles
37
Core Idea - DFS with Memoization
38
Core Idea - Color-Based Detection
39
Planet Cycles - Walkthrough
40
Planet Cycles - Lessons
41
Permutation Cycles
42
Cycle Decomposition
43
Application - Sorting with Swaps
44
Application - Josephus Problem
45
Space Improvement
46
Common Mistakes
47
Section Recap
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
30.1
Intro
3 minutes
100%
Tasks
Read Unit