Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Dijkstra's Algorithm
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
1
Intro
2
Introducing Weights
3
The Greedy Strategy
4
Dijkstra's Algorithm - Setup
5
Dijkstra's Algorithm - The Loop
6
The Relaxation Step
7
Quiz: Dijkstra's Greedy Choice
8
Relaxation in Code
9
Dijkstra - Implementation
10
Complexity of Dijkstra
11
Path Reconstruction in Dijkstra
12
Handling Large Weights
13
Quiz: Why Negative Edges Break Dijkstra
14
LeetCode 743 Network Delay Time - Problem Statement
15
LeetCode 743 Network Delay Time - Intuition
16
LeetCode 743 Network Delay Time - Implementation
17
CSES 1671 Shortest Routes I - Problem Statement
18
LeetCode 1514 Path with Maximum Probability - Problem Statement
19
LeetCode 1514 Path with Maximum Probability - Modifying Dijkstra
20
Quiz: Dijkstra Modifications
21
LeetCode 787 Cheapest Flights Within K Stops - Problem Statement
22
LeetCode 787 Cheapest Flights Within K Stops - State Definition
23
LeetCode 787 Cheapest Flights Within K Stops - Algorithm
24
LeetCode 787 Cheapest Flights Within K Stops - Visited Set
25
LeetCode 787 Cheapest Flights Within K Stops - Implementation
26
LeetCode 787 Cheapest Flights Within K Stops - Lessons
27
Quiz: Dijkstra with Constraints
28
LeetCode 1631 Path with Minimum Effort - Problem Statement
29
LeetCode 1631 Path with Minimum Effort - Minimax Path
30
LeetCode 1631 Path with Minimum Effort - Algorithm
31
LeetCode 1631 Path with Minimum Effort - Priority Queue
32
LeetCode 1631 Path with Minimum Effort - Implementation
33
LeetCode 1631 Path with Minimum Effort - Lessons
34
Quiz: Dijkstra on Grids
35
CSES 1195 Flight Discount - Problem Statement
36
CSES 1195 Flight Discount - State Definition
37
CSES 1195 Flight Discount - Algorithm
38
CSES 1195 Flight Discount - Implementation
39
CSES 1195 Flight Discount - Lessons
40
Section Recap
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
10.1
Intro
4 minutes
100%
Tasks
Read Unit