What you would learn in Graph Theory Algorithms for Competitive Programming (2021) course?
Welcome to Graph Algorithms For Competitive Coding - The most comprehensive Specialization in Graph Theory available for Software Engineers, Software Engineers, and Computer Science Students! Graphs are an important topic for software engineers for both academics & online contests and solving real-life problems. Graph algorithms are the foundation of many popular apps such as Google Maps, Instagram, Quora, and LinkedIn. They also provide information about Computer Vision applications, such as image segmentation, solving dependencies during compile time, vehicle routing issues in the supply chain, and other useful applications. This course will provide a comprehensive overview of Graph Theory algorithms and hands-on implementation of all algorithms in C++. You will also receive 80+ competitive coding questions to help you practice and test your skills.
Prateek Narang and Apaar Kamal, both Google Software Engineers, will be teaching this course. They have taught thousands of students competitive programming over the past 5+ years. While this course would have cost thousands, Coding Minutes offers it at a fraction of the original price. This course is action-oriented. We not only cover theory but also focus on the practical side by solving problems and building algorithms. This course is packed with over 95+ video lectures and easy-to-understand explanations. The course begins with the basics of how to store and display graphs on a computer. Next, it dives into popular algorithms and techniques for solving problems. There are two parts to the course.
Part-I Graph Theory Essentials
Representations of graphs
Popular Traversals – BFS & DFS
Cycle Detection – Weighted and Unweighted Graphics
Topological Ordering & Directed acyclic Graphs
Union by Rank, Path Compression, Disjoint Set Union
Part-II is for programmers who wish to take a deeper dive into Competitive Programming and participate in contests. Part-II is sufficient for most students to grasp the fundamental concepts and techniques of graphs.
Graph Basics, Application
BFS, DFS, and Connected Components
Shortest Paths – Dijkstra Bellman, Floyd Warshall
Travelling Salesman Problem-DP with Bitmasks
Topological Ordering, Strongly Connected Parts
Disjoint Set Union. Minimum Spanning Trees. Prim's & Kraskal.
Advanced Graphs, Euler Tour and Trees
Articulation Points, LCA, Network Flow
Graphs for Competitive Programming
80+ Competitive Coding Questions
Download Graph Theory Algorithms for Competitive Programming (2021) from below links NOW!