Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Graph Fundamentals
Problemset
Discussion
AI Helper
Graph Fundamentals
0/41
1
Intro
2
What is a Graph?
3
Real World Example - The Map
4
Real World Example - Social Networks
5
Why Graphs Matter
6
Vocabulary - The Vertex
7
Vocabulary - The Edge
8
Quiz: Vertices and Edges
9
Formal Notation
10
Types of Graphs - Undirected
11
Types of Graphs - Directed
12
Classify the Graph
13
The Representation Problem
14
Quiz: Directed vs Undirected
15
Method 1 - The Adjacency Matrix
16
Matrix - Visual Example
17
Matrix - The Problem
18
Method 2 - The Adjacency List
19
Adjacency List - Visual Example
20
Adjacency List - Efficiency
21
Quiz: Adjacency Matrix vs List
22
Implementing in C++
23
Explaining the Syntax
24
Adding Directed Edges
25
Adding Undirected Edges
26
Graph Degrees
27
Directed Degrees
28
Quiz: Graph Degrees
29
Problem Time - Town Judge
30
Town Judge - The Story
31
Town Judge - Graph Translation
32
Town Judge - The Algorithm
33
Town Judge - Implementation
34
Problem Time - Star Graph
35
Star Graph - Method 1
36
Star Graph - Method 2
37
Star Graph - The Trick
38
Star Graph - Implementation
39
Quiz: Graph Representations in Code
40
Cities and Roads
41
Section Recap
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
Mixed Practice: Advanced Graphs
0/24
1.1
Intro
1 minute
100%
Tasks
Read Unit
Graph Theory - Roadmaps | Repovive