Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Mixed Practice - Shortest Paths
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
1
Intro
2
The Decision Tree
3
Quiz: Algorithm Selection
4
When BFS Wins
5
When Dijkstra Wins
6
Quiz: Dijkstra Traps
7
When Bellman-Ford Wins
8
Negative Cycles: The Trap
9
Quiz: Negative Cycles
10
When Floyd-Warshall Wins
11
CSES 1671 Shortest Routes I - Problem Statement
12
CSES 1671 Shortest Routes I - Recognizing Dijkstra
13
CSES 1671 Shortest Routes I - Implementation Notes
14
Quiz: Dijkstra Optimization
15
CSES 1671 Shortest Routes I - Implementation
16
CSES 1673 High Score - Problem Statement
17
CSES 1673 High Score - The Maximum-Score Trick
18
CSES 1673 High Score - The Reachability Trap
19
Quiz: Negative Cycle Impact
20
CSES 1673 High Score - Implementation
21
CSES 1195 Flight Discount - Problem Statement
22
CSES 1195 Flight Discount - State-Space Graphs
23
CSES 1195 Flight Discount - Transitions
24
Quiz: State Graph Size
25
CSES 1195 Flight Discount - Implementation
26
CSES 1202 Investigation - Problem Statement
27
CSES 1202 Investigation - Counting During Dijkstra
28
CSES 1202 Investigation - Update Rules
29
Quiz: Counting Paths
30
CSES 1202 Investigation - Implementation
31
Codeforces 295B Greg and Graph - Problem Statement
32
Codeforces 295B Greg and Graph - The Reverse Trick
33
Codeforces 295B Greg and Graph - Floyd-Warshall Incremental
34
Quiz: Reverse Processing
35
Codeforces 295B Greg and Graph - Implementation
36
Section Recap
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
12.1
Intro
3 minutes
100%
Tasks
Read Unit