Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Floyd-Warshall 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
1
Intro
2
The All-Pairs Problem
3
Naive Approach
4
The Core Idea
5
The DP State
6
Space Improvement
7
Quiz: Floyd-Warshall DP State
8
Why k is Outermost
9
The Algorithm
10
Time Complexity
11
Handling Negative Edges
12
Detecting Negative Cycles
13
Quiz: Negative Edges in Floyd-Warshall
14
Path Reconstruction
15
Transitive Closure
16
When to Use Floyd-Warshall
17
Quiz: When to Use Floyd-Warshall
18
CSES 1672 Shortest Routes II - Problem Statement
19
CSES 1672 Shortest Routes II - Why Floyd-Warshall Fits
20
CSES 1672 Shortest Routes II - Handling Multiple Edges
21
CSES 1672 Shortest Routes II - Implementation
22
CSES 1672 Shortest Routes II - Walkthrough
23
CSES 1672 Shortest Routes II - Lessons
24
LeetCode 1334 Find the City - Problem Statement
25
LeetCode 1334 Find the City - Breaking Down the Problem
26
LeetCode 1334 Find the City - Counting Reachable Cities
27
LeetCode 1334 Find the City - Implementation
28
LeetCode 1334 Find the City - Walkthrough
29
LeetCode 1334 Find the City - Lessons
30
Quiz: Floyd-Warshall Path Reconstruction
31
Common Mistakes
32
Floyd-Warshall vs Bellman-Ford
33
Floyd-Warshall vs Johnson's Algorithm
34
Practical Constraints
35
Memory Layout
36
Infinity Handling
37
Undirected Graphs
38
Variants of Floyd-Warshall
39
Quiz: Floyd-Warshall Loop Order
40
Practice Problems
41
Section Recap
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
9.1
Intro
3 minutes
100%
Tasks
Read Unit