Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Euler Tour Technique
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
1
Intro
2
What is an Euler Tour
3
Entry and Exit Times
4
Subtrees as Ranges
5
Flattening the Tree
6
Basic Implementation
7
Example Tree
8
Quiz: Entry and Exit Times
9
Check Your Understanding
10
Problem - Subtree Queries
11
Core Idea - Subtree to Range
12
Core Idea - Which Times to Use
13
Algorithm
14
Subtree Queries - Implementation
15
Subtree Queries - Walkthrough
16
Lessons Learned
17
Quiz: Subtree as Range
18
Euler Tour Variants
19
Entry-Only Variant
20
Entry-Exit Variant
21
Full Tour Variant
22
Quiz: Euler Tour Variants
23
Check Your Understanding
24
Problem - Path Queries
25
Core Idea - Path as Prefix
26
Core Idea - Prefix Sum Trick
27
Algorithm
28
Path Queries - Implementation
29
Path Queries - Walkthrough
30
Lessons Learned
31
Quiz: Path Query Updates
32
Combining with Segment Trees
33
BIT as Lighter Alternative
34
Space Complexity
35
Update Types
36
Query Types
37
Ancestor Check
38
Rerooting Limitation
39
Check Your Understanding
40
DFS Order Matters
41
Quiz: Ancestor Check
42
Connection to Heavy-Light Decomposition
43
Practical Tips
44
Common Mistakes
45
Problem - Company Queries II
46
Core Idea - LCA via Euler Tour
47
Algorithm
48
Company Queries II - Implement Solution
49
Lessons Learned
50
Quiz: Combining with Data Structures
51
Section Recap
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
22.1
Intro
3 minutes
100%
Tasks
Read Unit