Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Euler Paths and Circuits
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
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
1
Intro
2
What is an Euler Path
3
What is an Euler Circuit
4
Conditions for Undirected Graphs
5
Conditions for Directed Graphs
6
Quiz: Euler Path Conditions
7
Checking Eulerian Conditions
8
Hierholzer's Algorithm
9
Hierholzer's Pseudocode
10
Why Hierholzer Works
11
Quiz: Hierholzer's Algorithm
12
Time and Space Complexity
13
Problem - Mail Delivery
14
Mail Delivery - Core idea
15
Mail Delivery - Algorithm
16
Mail Delivery - Implementation
17
Mail Delivery - Lessons
18
Quiz: Directed Euler Path Conditions
19
Problem - Teleporters Path
20
Teleporters Path - Core idea
21
Teleporters Path - Implementation
22
Teleporters Path - Lessons
23
Problem - Reconstruct Itinerary
24
Reconstruct Itinerary - Core idea
25
Reconstruct Itinerary - Implementation
26
Quiz: Lexicographic Euler Path
27
De Bruijn Sequences
28
Problem - De Bruijn Sequence
29
De Bruijn Sequence - Core idea
30
De Bruijn Sequence - Implementation
31
Quiz: De Bruijn Sequences
32
Problem - Cracking the Safe
33
Cracking the Safe - Core idea
34
Chinese Postman Problem
35
Applications
36
Common Mistakes
37
Section Recap
Mixed Practice: Advanced Graphs
0/24
36.1
Intro
5 minutes
100%
Tasks
Read Unit