After completing the course, you will learn…
-
Graph Basics, Applications
-
BFS, DFS, Connected Components
-
Shortest Paths – Dijkstra, Bellman, Floyd Warshall
-
Travelling Salesman Problem – DP with Bitmasks
-
Topological Ordering, Strongly Connected Components
-
Disjoint Set Union, Minimum Spanning Trees, Prim’s & Kruskal
-
Advanced Graphs, Euler Tour, Trees
-
Network Flow, LCA, Articulation Points
-
Graphs for Competitive Programming
-
80 + Competitive Coding Questions
Who this course is for:
- Intermediate-Advanced Programmers with basic coding experience
- College/ University students pursuing Computer Science or related fields
- Passionate programmers who want deep dive into Graph Theory
- Competitive Programmers who want to excel in online coding competitions
Deal Score-5
Disclosure: This post may contain affiliate links and we may get small commission if you make a purchase. Read more about Affiliate disclosure here.
