Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Bellman-Ford 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
Bellman-Ford Algorithm
0/48
1
Intro
2
When Dijkstra Fails
3
The Relaxation Operation
4
Bellman-Ford Strategy
5
Why $n-1$ Iterations
6
Basic Bellman-Ford Implementation
7
Time Complexity Analysis
8
Quiz: Relaxation and Iterations
9
Detecting Negative Cycles
10
Finding Affected Nodes
11
CSES 1673 High Score - Problem Statement
12
CSES 1673 High Score - Negating Weights
13
CSES 1673 High Score - Detecting Positive Cycles
14
CSES 1673 High Score - Two-Way Reachability
15
CSES 1673 High Score - Algorithm
16
CSES 1673 High Score - Implementation
17
CSES 1673 High Score - Walkthrough
18
CSES 1673 High Score - Lessons
19
Quiz: Negative Cycle Reachability
20
CSES 1197 Cycle Finding - Problem Statement
21
CSES 1197 Cycle Finding - Parent Tracking
22
CSES 1197 Cycle Finding - Finding Cycle Start
23
CSES 1197 Cycle Finding - Algorithm
24
CSES 1197 Cycle Finding - Implementation
25
CSES 1197 Cycle Finding - Walkthrough
26
CSES 1197 Cycle Finding - Lessons
27
Quiz: Cycle Reconstruction
28
LeetCode 787 Cheapest Flights Within K Stops - Problem Statement
29
LeetCode 787 Cheapest Flights Within K Stops - Layer-by-Layer Relaxation
30
LeetCode 787 Cheapest Flights Within K Stops - Temporal Separation
31
LeetCode 787 Cheapest Flights Within K Stops - Algorithm
32
LeetCode 787 Cheapest Flights Within K Stops - Implementation
33
LeetCode 787 Cheapest Flights Within K Stops - Walkthrough
34
LeetCode 787 Cheapest Flights Within K Stops - Lessons
35
Quiz: Bounded Relaxation
36
SPFA Improvement
37
SPFA Implementation
38
SPFA Cycle Detection
39
When to Use Bellman-Ford
40
Application: Currency Arbitrage
41
Quiz: Algorithm Selection
42
Application: Network Routing
43
Edge Cases and Mistakes
44
Comparison Summary
45
Common Mistakes
46
Quiz: SPFA Worst Case
47
Practice Strategy
48
Section Recap
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
11.1
Intro
3 minutes
100%
Tasks
Read Unit