Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Games on Graphs
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
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
1
Intro
2
Positions as States
3
Winning vs Losing Positions
4
Terminal Positions
5
Backward Induction on DAGs
6
Why DAGs Are Simple
7
Quiz: Winning and Losing Positions
8
Games with Cycles
9
Classifying with Cycles
10
Implementation Pattern
11
Quiz: Backward Induction
12
Problem - Cat and Mouse (Part 1)
13
Problem - Cat and Mouse (Part 2)
14
Problem - Cat and Mouse (Part 3)
15
Problem - Cat and Mouse (Part 4)
16
Problem - Cat and Mouse (Part 5)
17
Problem - Cat and Mouse (Part 6)
18
Problem - Cat and Mouse (Part 7)
19
Problem - Cat and Mouse (Part 8)
20
Problem - Cat and Mouse (Part 9)
21
Problem - Cat and Mouse (Part 10)
22
Problem - Cat and Mouse (Part 11)
23
Problem - Cat and Mouse (Part 12)
24
Two-Player vs Single-Player
25
Nim-Like Games on Graphs
26
Computing Grundy Numbers
27
When to Use Grundy
28
Quiz: Sprague-Grundy Values
29
Pursuit-Evasion Games
30
Cops and Robbers on Trees
31
Cops and Robbers on General Graphs
32
Problem - Coin Game on DAG (Part 1)
33
Problem - Coin Game on DAG (Part 2)
34
Problem - Coin Game on DAG (Part 3)
35
Problem - Coin Game on DAG (Part 4)
36
Problem - Coin Game on DAG (Part 5)
37
Problem - Coin Game on DAG (Part 6)
38
Move Ordering Strategies
39
Distance to Win
40
Minimax on Graphs
41
Alpha-Beta Pruning
42
Quiz: Minimax on Graphs
43
Memoization for Graph Games
44
Problem - Game on Tree (Part 1)
45
Problem - Game on Tree (Part 2)
46
Problem - Game on Tree (Part 3)
47
Problem - Game on Tree (Part 4)
48
Infinite Games
49
Draw Detection Strategies
50
Quiz: Draw Detection in Cyclic Games
51
Bipartite Game Graphs
52
Applications in AI
53
Applications in Network Security
54
Applications in Robotics
55
Stochastic Games
56
Complexity of Game Analysis
57
When to Use Game Theory
58
Common Mistakes
59
Quiz: Game State Representation
60
Debugging Game Code
61
Extensions and Variants
62
Section Recap
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
26.1
Intro
3 minutes
100%
Tasks
Read Unit