Competitive Programming Roadmap
Graph Algorithms II
Learning Path
Follow these concepts in order to master this topic.
1
Shortest Path Problems2
Single Source vs All-Pairs Shortest Paths3
Breadth-First Search Shortest Path4
0-1 BFS5
Dijkstra's Algorithm6
Bellman-Ford Algorithm7
Floyd-Warshall Algorithm8
Path Reconstruction9
Negative Cycles10
Minimum Spanning Tree (MST)11
Prim's Algorithm12
Kruskal's Algorithm13
Disjoint Set Union (Union Find)14
Union by Rank15
Path Compression16
Dense vs Sparse Graphs17
Choosing the Right Graph Algorithm18
Common Graph Optimization Techniques19
Contest Graph Patterns20
Real Competitive Programming Case StudiesDocumentation
Official documentation and references.
Video Courses
Recommended free video courses.
Practice Websites
Practice what you've learned.
Projects
Apply what you've learned by building real projects.
Build a Complete Graph Algorithms Library
AdvancedImplement Every Major Shortest Path Algorithm
AdvancedSolve 75 Weighted Graph Problems
Advanced