Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Breadth First Search (BFS)
Problemset
Discussion
AI Helper
Graph Fundamentals
0/41
Depth First Search (DFS)
0/41
Breadth First Search (BFS)
0/40
1
Intro
2
The Ripple Effect
3
The Data Structure
4
The BFS Strategy
5
The BFS Algorithm Step 1
6
The BFS Algorithm Step 2
7
The BFS Algorithm Step 3
8
Why does this find Shortest Path?
9
Quiz: BFS Shortest Path Guarantee
10
Tracking Distances
11
Implicit Graphs
12
Complexity of BFS
13
Quiz: BFS Complexity
14
DFS vs BFS Summary
15
BFS Variants Summary
16
LeetCode 1091 Shortest Path in Binary Matrix - Problem Statement
17
LeetCode 1091 Shortest Path in Binary Matrix - Grid BFS
18
LeetCode 1091 Shortest Path in Binary Matrix - Implementation Details
19
LeetCode 1091 Shortest Path in Binary Matrix - Direction Arrays
20
CSES 1667 Message Route - Problem Statement
21
CSES 1667 Message Route - Path Reconstruction Idea
22
CSES 1667 Message Route - Path Reconstruction Algorithm
23
CSES 1667 Message Route - Implementation
24
Quiz: BFS Path Reconstruction
25
LeetCode 127 Word Ladder - Problem Statement
26
LeetCode 127 Word Ladder - Finding Neighbors
27
LeetCode 127 Word Ladder - Implementation
28
LeetCode 994 Rotting Oranges - Problem Statement
29
LeetCode 994 Rotting Oranges - Core Idea
30
LeetCode 994 Rotting Oranges - Algorithm
31
LeetCode 994 Rotting Oranges - Implementation
32
LeetCode 994 Rotting Oranges - Lessons
33
Quiz: Multi-Source BFS
34
LeetCode 542 01 Matrix - Problem Statement
35
LeetCode 542 01 Matrix - Core Idea
36
LeetCode 542 01 Matrix - Algorithm
37
LeetCode 542 01 Matrix - Implementation
38
LeetCode 542 01 Matrix - Lessons
39
Quiz: BFS vs DFS for Shortest Path
40
Section Recap
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
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
3.1
Intro
2 minutes
100%
Tasks
Read Unit