Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Bipartite 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
1
Intro
2
What Is a Bipartite Graph?
3
Vocabulary - 2-Coloring
4
Vocabulary - Partition
5
Real World Examples
6
The Odd Cycle Rule
7
Visualizing the Odd Cycle
8
Quiz: Bipartite Basics
9
Detection Strategy
10
BFS for Detection
11
DFS for Detection
12
Disconnected Graphs
13
DFS Implementation
14
BFS vs DFS Trade-offs
15
Common Mistakes
16
Time and Space Complexity
17
LeetCode 785 Is Graph Bipartite? - Problem Statement
18
LeetCode 785 Is Graph Bipartite? - Input Format
19
LeetCode 785 Is Graph Bipartite? - The Color Array
20
LeetCode 785 Is Graph Bipartite? - Detecting Conflicts
21
LeetCode 785 Is Graph Bipartite? - The Outer Loop
22
LeetCode 785 Is Graph Bipartite? - Algorithm
23
LeetCode 785 Is Graph Bipartite? - Implementation
24
LeetCode 785 Is Graph Bipartite? - Walkthrough
25
LeetCode 785 Is Graph Bipartite? - Conflict Example
26
LeetCode 785 Is Graph Bipartite? - Lessons
27
Quiz: Detection Logic
28
LeetCode 886 Possible Bipartition - Problem Statement
29
LeetCode 886 Possible Bipartition - Story
30
LeetCode 886 Possible Bipartition - Recognizing the Pattern
31
LeetCode 886 Possible Bipartition - Building the Graph
32
LeetCode 886 Possible Bipartition - Index Handling
33
LeetCode 886 Possible Bipartition - Algorithm
34
LeetCode 886 Possible Bipartition - Implementation
35
LeetCode 886 Possible Bipartition - Walkthrough
36
LeetCode 886 Possible Bipartition - Lessons
37
Quiz: Problem Recognition
38
CSES 1668 Building Teams - Problem Statement
39
CSES 1668 Building Teams - Input Format
40
CSES 1668 Building Teams - Output Format
41
CSES 1668 Building Teams - Core Idea
42
CSES 1668 Building Teams - Algorithm
43
CSES 1668 Building Teams - Implementation
44
CSES 1668 Building Teams - Walkthrough
45
CSES 1668 Building Teams - Lessons
46
Quiz: Edge Cases
47
What's Next
48
Section Recap
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
5.1
Intro
2 minutes
100%
Tasks
Read Unit