Graph Theory Algorithms for Competitive Programming

Learn Graphs Algorithms in Computer Science & Mathematics, theory + hands-on coding and ace Competitive Coding problems!

Created by: Prateek Narang
Instructor & Entrepreneur - Google, Coding Minutes, Scaler

Created by: Apaar Kamal
Software Engineer at Google

Created by: Coding Minutes
Pocket friendly way to learn with experts!

What Will I 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
• Complete Code Repository in C++ and Java
• Coding Exercises Solutions

Requirements

• Familiarity with basic data structures
• Ability to write / understand code
• Prior experience in problem solving

Target audience

• 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