Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Bridges and Articulation Points
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
1
Intro
2
What is a Bridge?
3
Bridge Example
4
Why Bridges Matter
5
What is an Articulation Point?
6
Articulation Point Example
7
DFS Tree and Back Edges
8
DFS Tree Example
9
Why Back Edges Prevent Bridges
10
Discovery Time
11
Low-Link Value
12
Low-Link Intuition
13
Low-Link Example
14
Quiz: Low-Link Values
15
Tarjan's Algorithm for Bridges
16
Bridge Detection Logic
17
Tarjan Bridge Pseudocode
18
Bridge Algorithm Walkthrough
19
Quiz: Bridge Detection Condition
20
Tarjan's Algorithm for Articulation Points
21
Articulation Point: Root Case
22
Articulation Point: Non-Root Case
23
Articulation Point Pseudocode
24
Articulation Point Walkthrough
25
Quiz: Articulation Point Rules
26
Vocabulary - Critical Connection
27
Problem - Critical Connections in a Network
28
Critical Connections - Input Example
29
Critical Connections - Core Idea
30
Critical Connections - Algorithm
31
Critical Connections - Implementation
32
Critical Connections - Trace
33
Critical Connections - Time Complexity
34
Critical Connections - Edge Cases
35
Critical Connections - Lessons
36
Vocabulary - 2-Edge-Connected Component
37
Building 2-Edge-Connected Components
38
2-Edge-Connected Components Example
39
Quiz: $2$-Edge-Connected Components
40
Problem - Finding Articulation Points
41
Articulation Points - Input Example
42
Articulation Points - Core idea
43
Articulation Points - Algorithm
44
Articulation Points - Implementation
45
Articulation Points - Trace
46
Articulation Points - Time Complexity
47
Articulation Points - Edge Cases
48
Articulation Points - Lessons
49
Quiz: Tarjan's Algorithm Complexity
50
Application - Network Reliability
51
Application - Graph Partitioning
52
Application - Circuit Design
53
Vocabulary - Biconnected Component
54
Building Biconnected Components
55
Bridge Trees
56
Quiz: Bridge Trees
57
Bridge Tree Example
58
Section Recap
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
32.1
Intro
3 minutes
100%
Tasks
Read Unit