Graph Theory Algorithms for Competitive Programming [Udemy Coupon Code]

"When you purchase something through one of the links on our site, we may earn an affiliate commission at no additional cost to you."

Limited offer hurry up

Graph Theory Algorithms for Competitive Programming is a top-rated Udemy course taught by Prateek Narang Sr. Software Engineer Google, Apaar Kamal, Coding Minutes — with over 10845+ students enrolled since it launched.

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

Don’t wait! This special offer won’t last long.

Click the button below to Get up to 100% OFF the regular price.

(The discount will be applied automatically at checkout — no code needed!)

Hurry — this discount on Graph Theory Algorithms for Competitive Programming won’t be around forever. Take action now!

100% off Udemy coupon code

Why enroll in the Graph Theory Algorithms for Competitive Programming Udemy Course?

  • Udemy gives you access to over 250,000 courses and 85,000 expert instructors worldwide.
  • Courses are led by experienced professionals dedicated to delivering a high-quality learning experience.
  • Many of Udemy’s most popular courses have hundreds of thousands of students enrolled.
  • Udemy offers online coupons, promo codes and voucher for the majority of its courses.

Graph Theory Algorithms for Competitive Programming Udemy Promotion code

Course Sections
Introduction
Setting Up Sublime [optional]Graph Representation
Breath First Search
Depth First Search
Cycle Detection
Directed Acyclic Graph
Disjoint Set Union
Minimum Spanning Trees
Shortest Path Algorithms
Travelling Salesman Problem
Flood Fill
Multi – Source BFS
DFS-Tree and Backedges
Articulation Points & Bridges
Strongly Connected Components
Trees
Euler Tour
LCA
Re-rooting of trees
Dynamic Programming On Trees
Network Flow
Bonus : Graph + Data Structures
Course Description
Requirements
Familiarity with basic data structures
Ability to write / understand code
Prior experience in problem solving

Welcome to Graph Algorithms for Competitive Coding – the most detailed Specialisation in Graph Theory for Competitive Programmers, Software Engineers & Computer Science students!

Graphs is quite an important topic for software engineers, both for academics & online competitions and for solving real life challenges. Graph algorithms form the very fundamentals of many popular applications like – Google Maps, social media apps like Facebook, Instagram, Quora, LinkedIn, Computer Vision applications such as image segmentation, resolving dependencies while compile time, vehicle routing problems in supply chain and many more. This course provides a detailed overview of Graph Theory algorithms in computer science, along with hands on implementation of all the algorithms in C++. Not just that you will get 80+ competitive coding questions, to practice & test your skills! 

This comprehensive course is taught by Prateek Narang & Apaar Kamal, who are Software Engineers at Google and have taught over thousands of students in competitive programming over last 5+ years. This course is worth thousands of dollars, but Coding Minutes is providing you this course to you at a fraction of its original cost! This is action oriented course, we not just delve into theory but focus on the practical aspects by building implementing algorithms & solving problems. With over 95+ high quality video lectures, easy to understand explanations this is one of the most detailed and robust course for Graph Algorithms ever created.

Course starts very basics with how to store and represent graphs on a computer, and then dives into popular algorithms & techniques for problem solving. The course is divided into two parts.

Part-I Graph Theory Essentials

Graph Representations

Popular Traversals – BFS & DFS

Cycle Detection – Weighted & Unweighted Graphs

Topological Ordering & Directed Acyclic Graphs

Disjoint Set Union, Path Compression & Union by Rank

Minimum Spanning Trees – Prim’s & Kruskal’s

Shortest Paths – BFS, Dijkstra’s, Bellman Ford, Floyd Warshall

Travelling Salesman Problem, Min Cost Hamiltonian Cycle

Part-II Graph Theory Advanced

Flood Fill

Multisource BFS

DFS & Backedges

SCC’s & Kosaraju’s Algorithm

Euler Tour

LCA

Trees

Articulation Points & Bridges

Network Flow
The part-II is recommended for programmers who want to deep dive into Competitive Programming & take part in contests. For most students part-I is good enough to understand the most fundamental concepts and techniques in graphs!

Our special thanks to our problem setters, Siddharth Singhal & Rajdeep from Delhi Technological University, who helped us crafting the complete problem-set for this course.

So what you are waiting for ? Sign up today & start your deep-dive into graph theory!