Graph Theory Algorithms for Competitive Programming

Graph Theory Algorithms for Competitive Programming, available at $84.99, has an average rating of 4.37, with 118 lectures, 80 quizzes, based on 732 reviews, and has 9884 subscribers.

You will learn about 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 This course is ideal for individuals who are Intermediate-Advanced Programmers with basic coding experience or College/ University students pursuing Computer Science or related fields or Passionate programmers who want deep dive into Graph Theory or Competitive Programmers who want to excel in online coding competitions It is particularly useful for Intermediate-Advanced Programmers with basic coding experience or College/ University students pursuing Computer Science or related fields or Passionate programmers who want deep dive into Graph Theory or Competitive Programmers who want to excel in online coding competitions.

Enroll now: Graph Theory Algorithms for Competitive Programming

Summary

Title: Graph Theory Algorithms for Competitive Programming

Price: $84.99

Average Rating: 4.37

Number of Lectures: 118

Number of Quizzes: 80

Number of Published Lectures: 118

Number of Published Quizzes: 80

Number of Curriculum Items: 198

Number of Published Curriculum Objects: 198

Original Price: ₹7,900

Quality Status: approved

Status: Live

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

Who Should Attend

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

Target Audiences

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

Welcome to Graph Algorithms for Competitive Coding – the most detailed Specialisation in Graph Theoryfor 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!

Course Curriculum

Chapter 1: Introduction

Lecture 1: Course Orientation!

Lecture 2: Q/A Section & Discord Community

Lecture 3: Graphs Code Repository C++ and Java!

Lecture 4: Exercise Solutions – Code Repository!

Lecture 5: Sharing Feedback

Chapter 2: Setting Up Sublime [optional]

Lecture 1: Sublime Setup

Lecture 2: Adding Master Header File

Lecture 3: Escaping Online Judges

Lecture 4: Common Code Snippets

Lecture 5: Using Macros

Lecture 6: Example Code Explained

Chapter 3: Graph Representation

Lecture 1: Graphs Introduction

Lecture 2: Graph Applications

Lecture 3: Graph Key Terms

Lecture 4: Adjacency List Representation

Lecture 5: Adjacency List Representation with Node Class

Lecture 6: Some Helpful Webinars [Optional]

Chapter 4: Breath First Search

Lecture 1: Breadth First Search

Lecture 2: BFS Code

Lecture 3: BFS Shortest Path

Lecture 4: BFS Shortest Path Code

Lecture 5: Snakes and Ladder Solution

Chapter 5: Depth First Search

Lecture 1: DFS Concept

Lecture 2: DFS Code

Lecture 3: Largest Island Solution

Chapter 6: Cycle Detection

Lecture 1: Cycle Detection in Undirected Graph

Lecture 2: Cycle Detection in Undirected Graph Code

Lecture 3: Directed Graph – Cycle Detection

Lecture 4: Directed Graph – Cycle Detection Code

Lecture 5: Bipartite Graph

Lecture 6: Bipartite Graph Code

Chapter 7: Directed Acyclic Graph

Lecture 1: Directed Acyclic Graph & Topological Ordering

Lecture 2: Topological Sort Algorithm

Lecture 3: Topological Ordering BFS Code

Lecture 4: Toplogical Order using DFS

Lecture 5: Topological Ordering using DFS Code

Chapter 8: Disjoint Set Union

Lecture 1: Disjoint Set Union Introduction

Lecture 2: DSU Data Structure – Union & Find Ops

Lecture 3: DSU Data Structure

Lecture 4: DSU Implementation

Lecture 5: Union by Rank

Lecture 6: Path Compression Optimisation

Lecture 7: DSU Dry Run

Chapter 9: Minimum Spanning Trees

Lecture 1: Introduction to Minimum Spanning Trees!

Lecture 2: Prim's Algorithm

Lecture 3: Prim's Code

Lecture 4: Kruskal's Algorithm

Lecture 5: Kruskal's Code

Chapter 10: Shortest Path Algorithms

Lecture 1: Introduction to Shortest Path Algorithms

Lecture 2: Dijkshtra's Algorithm

Lecture 3: Dijkshtra's Algorithm Code

Lecture 4: Bellman Ford Algorithm

Lecture 5: Bellman Ford Code

Lecture 6: Floyd Warshall

Lecture 7: Floyd Warshall Code

Instructors

Prateek Narang
Instructor & Entrepreneur – Google, Coding Minutes, Scaler
Apaar Kamal
Software Engineer at Google
Coding Minutes
Pocket friendly way to learn with experts!

Rating Distribution

1 stars: 16 votes
2 stars: 10 votes
3 stars: 44 votes
4 stars: 190 votes
5 stars: 472 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!

Menu