Topics

20

Duration

40 Weeks

Progress

0/20

Learning Progress0%
Competitive Programming Roadmap

Advanced Graph Algorithms

Learning Path

Follow these concepts in order to master this topic.

1
Review of Graph Theory
2
Strongly Connected Components (SCC)
3
Kosaraju's Algorithm
4
Bridges in Graphs
5
Articulation Points
6
Biconnected Components
7
Bridge Tree
8
Lowest Common Ancestor (LCA)
9
Binary Lifting
10
Euler Tour Technique
11
Heavy-Light Decomposition
12
Centroid Decomposition
13
Maximum Bipartite Matching
14
Hopcroft-Karp Algorithm
15
Maximum Flow
16
Ford-Fulkerson Algorithm
17
Edmonds-Karp Algorithm
18
Dinic's Algorithm
19
Minimum Cut
20
Flow with Lower Bounds
21
Network Flow Applications
22
Graph Condensation
23
Advanced Contest Graph Patterns

Documentation

Official documentation and references.

CP-Algorithms - Graph Algorithms

Recommended

CP-Algorithms - Network Flow

USACO Guide - Advanced Graphs

Competitive Programmer's Handbook

Video Courses

Recommended free video courses.

Advanced Graph Algorithms

6h 44m

Network Flow for Competitive Programming

1h

Practice Websites

Practice what you've learned.

CSES Advanced Graph Problems

Codeforces

AtCoder

OJ.uz

Projects

Apply what you've learned by building real projects.

Build an Advanced Graph Algorithms Library
Advanced
Implement LCA, HLD, SCC & Network Flow from Scratch
Advanced
Solve 100 Advanced Graph Problems
Advanced

Tools

Recommended tools for this topic.

CP-AlgorithmsUSACO GuideCodeforcesCSES Problem Set

Previous

Graph Algorithms II

Advanced

Next

Trees

Advanced