| 01 Introduction | |||
| 001 Course Orientation!.en.srt | 10.28 KB | ||
| 001 Course Orientation!.mp4 | 98.19 MB | ||
| 002 Q_A Section & Discord Community.html | 3.22 KB | ||
| 02 Graph Representation | |||
| 001 Graphs Introduction.en.srt | 17.64 KB | ||
| 001 Graphs Introduction.mp4 | 140.65 MB | ||
| 002 Graph Applications.en.srt | 8.27 KB | ||
| 002 Graph Applications.mp4 | 117.67 MB | ||
| 003 Graph Key Terms.en.srt | 12.91 KB | ||
| 003 Graph Key Terms.mp4 | 77.71 MB | ||
| 004 Adjacency List Representation.en.srt | 10.56 KB | ||
| 004 Adjacency List Representation.mp4 | 48.84 MB | ||
| 005 Adjacency List Representation with Node Class.en.srt | 10.97 KB | ||
| 005 Adjacency List Representation with Node Class.mp4 | 66.38 MB | ||
| 006 Some Helpful Webinars [Optional].html | 1.24 KB | ||
| 03 Breath First Search | |||
| 001 Breadth First Search.en.srt | 9.23 KB | ||
| 001 Breadth First Search.mp4 | 61.24 MB | ||
| 002 BFS Code.en.srt | 8.85 KB | ||
| 002 BFS Code.mp4 | 67.91 MB | ||
| 003 BFS Shortest Path.en.srt | 6.02 KB | ||
| 003 BFS Shortest Path.mp4 | 31.9 MB | ||
| 004 BFS Shortest Path Code.en.srt | 6.91 KB | ||
| 004 BFS Shortest Path Code.mp4 | 44.93 MB | ||
| 005 Snakes and Ladder Solution.en.srt | 11.92 KB | ||
| 005 Snakes and Ladder Solution.mp4 | 101.13 MB | ||
| 04 Depth First Search | |||
| 001 DFS Concept.en.srt | 5.85 KB | ||
| 001 DFS Concept.mp4 | 36.05 MB | ||
| 002 DFS Code.en.srt | 7 KB | ||
| 002 DFS Code.mp4 | 39.59 MB | ||
| 003 Largest Island Solution.en.srt | 16.75 KB | ||
| 003 Largest Island Solution.mp4 | 111.31 MB | ||
| 05 Cycle Detection | |||
| 001 Cycle Detection in Undirected Graph.en.srt | 5.23 KB | ||
| 001 Cycle Detection in Undirected Graph.mp4 | 40.57 MB | ||
| 002 Cycle Detection in Undirected Graph Code.en.srt | 10.67 KB | ||
| 002 Cycle Detection in Undirected Graph Code.mp4 | 58.88 MB | ||
| 003 Directed Graph - Cycle Detection.en.srt | 12.8 KB | ||
| 003 Directed Graph - Cycle Detection.mp4 | 97.69 MB | ||
| 004 Directed Graph - Cycle Detection Code.en.srt | 15.83 KB | ||
| 004 Directed Graph - Cycle Detection Code.mp4 | 119.14 MB | ||
| 005 Bipartite Graph.en.srt | 10.16 KB | ||
| 005 Bipartite Graph.mp4 | 33.72 MB | ||
| 006 Bipartite Graph Code.en.srt | 16.66 KB | ||
| 006 Bipartite Graph Code.mp4 | 63.96 MB | ||
| 06 Directed Acyclic Graph | |||
| 001 Directed Acyclic Graph & Topological Ordering.en.srt | 5.96 KB | ||
| 001 Directed Acyclic Graph & Topological Ordering.mp4 | 49.17 MB | ||
| 002 Topological Sort Algorithm.en.srt | 6.95 KB | ||
| 002 Topological Sort Algorithm.mp4 | 48.13 MB | ||
| 003 Topological Ordering BFS Code.en.srt | 7.07 KB | ||
| 003 Topological Ordering BFS Code.mp4 | 32 MB | ||
| 004 Toplogical Order using DFS.en.srt | 6.86 KB | ||
| 004 Toplogical Order using DFS.mp4 | 53.5 MB | ||
| 005 Topological Ordering using DFS Code.en.srt | 5.56 KB | ||
| 005 Topological Ordering using DFS Code.mp4 | 36.92 MB | ||
| 07 Disjoint Set Union | |||
| 001 Disjoint Set Union Introduction [TutFlix.ORG].mp4 | 44.62 MB | ||
| 001 Disjoint Set Union Introduction.en [TutFlix.ORG].srt | 5.58 KB | ||
| 002 DSU Data Structure [TutFlix.ORG].mp4 | 36.02 MB | ||
| 002 DSU Data Structure.en [TutFlix.ORG].srt | 8.66 KB | ||
| 003 DSU Implementation [TutFlix.ORG].mp4 | 64.22 MB | ||
| 003 DSU Implementation.en [TutFlix.ORG].srt | 14.9 KB | ||
| 004 Union by Rank [TutFlix.ORG].mp4 | 58.64 MB | ||
| 004 Union by Rank.en [TutFlix.ORG].srt | 11.25 KB | ||
| 005 Path Compression Optimisation [TutFlix.ORG].mp4 | 40.96 MB | ||
| 005 Path Compression Optimisation.en [TutFlix.ORG].srt | 10.7 KB | ||
| 006 DSU Dry Run [TutFlix.ORG].mp4 | 79.78 MB | ||
| 006 DSU Dry Run.en [TutFlix.ORG].srt | 15.66 KB | ||
| 08 Minimum Spanning Trees | |||
| 001 DSU Data Structure - Union & Find Ops.en.srt | 11.44 KB | ||
| 001 DSU Data Structure - Union & Find Ops.mp4 | 44.25 MB | ||
| 002 Introduction to Minimum Spanning Trees!.en.srt | 4.97 KB | ||
| 002 Introduction to Minimum Spanning Trees!.mp4 | 38.48 MB | ||
| 003 Prim's Algorithm.en.srt | 24.96 KB | ||
| 003 Prim's Algorithm.mp4 | 81.38 MB | ||
| 004 Prim's Code.en.srt | 21.67 KB | ||
| 004 Prim's Code.mp4 | 100.21 MB | ||
| 005 Kruskal's Algorithm.en.srt | 11.46 KB | ||
| 005 Kruskal's Algorithm.mp4 | 42.26 MB | ||
| 006 Kruskal's Code.en.srt | 15.28 KB | ||
| 006 Kruskal's Code.mp4 | 61.3 MB | ||
| 09 Shortest Path Algorithms | |||
| 001 Introduction to Shortest Path Algorithms.en.srt | 11.6 KB | ||
| 001 Introduction to Shortest Path Algorithms.mp4 | 84.18 MB | ||
| 002 Dijkshtra's Algorithm.en.srt | 12.95 KB | ||
| 002 Dijkshtra's Algorithm.mp4 | 96.14 MB | ||
| 003 Dijkshtra's Algorithm Code.en.srt | 19.2 KB | ||
| 003 Dijkshtra's Algorithm Code.mp4 | 117.14 MB | ||
| 004 Bellman Ford Algorithm.en.srt | 42.12 KB | ||
| 004 Bellman Ford Algorithm.mp4 | 141.2 MB | ||
| 005 Bellman Ford Code.en.srt | 10.13 KB | ||
| 005 Bellman Ford Code.mp4 | 38.55 MB | ||
| 006 Floyd Warshall.en.srt | 39.46 KB | ||
| 006 Floyd Warshall.mp4 | 221.95 MB | ||
| 007 Floyd Warshall Code.en.srt | 9.55 KB | ||
| 007 Floyd Warshall Code.mp4 | 49.49 MB | ||
| 008 Solution - Shortest Path in Grid!.en.srt | 15.73 KB | ||
| 008 Solution - Shortest Path in Grid!.mp4 | 75.59 MB | ||
| 10 Travelling Salesman Problem | |||
| 001 Travelling Salesman Problem.en.srt | 15.55 KB | ||
| 001 Travelling Salesman Problem.mp4 | 93.97 MB | ||
| 002 Travelling Salesman Intution.en.srt | 5.05 KB | ||
| 002 Travelling Salesman Intution.mp4 | 44.38 MB | ||
| 003 TSP Brute Force.en.srt | 15.26 KB | ||
| 003 TSP Brute Force.mp4 | 100.96 MB | ||
| 004 TSP DP + Bitmasking.en.srt | 3.68 KB | ||
| 004 TSP DP + Bitmasking.mp4 | 29.53 MB | ||
| 11 Flood Fill | |||
| 001 Flood Fill Introduction.en.srt | 7.48 KB | ||
| 001 Flood Fill Introduction.mp4 | 62.26 MB | ||
| 002 Number of Islands.en.srt | 24.37 KB | ||
| 002 Number of Islands.mp4 | 198.46 MB | ||
| 003 Coloring Islands.en.srt | 9.11 KB | ||
| 003 Coloring Islands.mp4 | 76.03 MB | ||
| 004 Biggest Island.en.srt | 4.65 KB | ||
| 004 Biggest Island.mp4 | 40.39 MB | ||
| 005 Make Largest island.en.srt | 25.23 KB | ||
| 005 Make Largest island.mp4 | 208.41 MB | ||
| 053 Flood Fill Total connected Components.cpp | 757 B | ||
| 054 Flood fill color count.cpp | 1.04 KB | ||
| 055 flood fill largest island.cpp | 1.41 KB | ||
| 056 Flood Fill make largest island.cpp | 1.41 KB | ||
| 12 Multi - Source BFS | |||
| 001 Introduction to Multi Source BFS.en.srt | 15.49 KB | ||
| 001 Introduction to Multi Source BFS.mp4 | 135.02 MB | ||
| 002 Problem on Multi Source BFS.en.srt | 27.15 KB | ||
| 002 Problem on Multi Source BFS.mp4 | 194.22 MB | ||
| 003 Bonus Problem on Multi Source BFS.en.srt | 22.91 KB | ||
| 003 Bonus Problem on Multi Source BFS.mp4 | 166.19 MB | ||
| 004 0_1 BFS.en.srt | 10.36 KB | ||
| 004 0_1 BFS.mp4 | 74.56 MB | ||
| 058 Multi source BFS minimum operations .cpp | 1.06 KB | ||
| 058 multisurce BFS (minimum distance).cpp | 1.06 KB | ||
| 059 shortest path from first row to last row.cpp | 1.26 KB | ||
| 13 DFS-Tree and Backedges | |||
| 001 Introduction to DFS tree and Backedges.en.srt | 13.13 KB | ||
| 001 Introduction to DFS tree and Backedges.mp4 | 84.02 MB | ||
| 002 DFS Tree and backedges in Undirected graph.en.srt | 24.39 KB | ||
| 002 DFS Tree and backedges in Undirected graph.mp4 | 159.44 MB | ||
| 003 DFS Tree and Backedges in Directed and Undirectde graphs.en.srt | 31.99 KB | ||
| 003 DFS Tree and Backedges in Directed and Undirectde graphs.mp4 | 218.19 MB | ||
| 004 Print cycle in a graph.en.srt | 14.26 KB | ||
| 004 Print cycle in a graph.mp4 | 85.59 MB | ||
| 062 DFS tree and backedge code.cpp | 668 B | ||
| 063 DFS tree and backedges in Directed Graphs.cpp | 793 B | ||
| 064 print cycle in a graph.cpp | 940 B | ||
| 14 Articulation Points & Bridges | |||
| 001 Introduction and definitions.en.srt | 18.35 KB | ||
| 001 Introduction and definitions.mp4 | 121.88 MB | ||
| 002 Discovered Time.en.srt | 16.81 KB | ||
| 002 Discovered Time.mp4 | 110.93 MB | ||
| 003 Lowest Time or Low Link.en.srt | 34.58 KB | ||
| 003 Lowest Time or Low Link.mp4 | 244.55 MB | ||
| 004 Algorithm.en.srt | 25.9 KB | ||
| 004 Algorithm.mp4 | 157.7 MB | ||
| 005 Coding the Algorithm.en.srt | 23.56 KB | ||
| 005 Coding the Algorithm.mp4 | 178.4 MB | ||
| 069 articulation point and bridges.cpp | 1.13 KB | ||
| 15 Strongly Connected Components | |||
| 001 Introduction to Topological Order and Strongly Connected Components [TutFlix.ORG].mp4 | 169.82 MB | ||
| 001 Introduction to Topological Order and Strongly Connected Components.en [TutFlix.ORG].srt | 25.78 KB | ||
| 002 Algorithm and Code to find Topological Ordering [TutFlix.ORG].mp4 | 183.79 MB | ||
| 002 Algorithm and Code to find Topological Ordering.en [TutFlix.ORG].srt | 27.97 KB | ||
| 003 Introduction to Strongly Connected Component [TutFlix.ORG].mp4 | 93.01 MB | ||
| 003 Introduction to Strongly Connected Component.en [TutFlix.ORG].srt | 14.29 KB | ||
| 004 Condensed Component Graph [TutFlix.ORG].mp4 | 127.01 MB | ||
| 004 Condensed Component Graph.en [TutFlix.ORG].srt | 17.47 KB | ||
| 005 Kosaraju Algorithm for Strongly Connected Component [TutFlix.ORG].mp4 | 320.35 MB | ||
| 005 Kosaraju Algorithm for Strongly Connected Component.en [TutFlix.ORG].srt | 41.65 KB | ||
| 006 Kosaraju Algorithm for Strongly Connected Component Code [TutFlix.ORG].mp4 | 109.47 MB | ||
| 006 Kosaraju Algorithm for Strongly Connected Component Code.en [TutFlix.ORG].srt | 13.9 KB | ||
| 071 topological Order [TutFlix.ORG].cpp | 672 B | ||
| 075 kosaraju algorithm for SCC [TutFlix.ORG].cpp | 1.06 KB | ||
| 16 Trees | |||
| 001 Introduction and properties of trees.en.srt | 32.36 KB | ||
| 001 Introduction and properties of trees.mp4 | 285.12 MB | ||
| 002 DFS on trees.en.srt | 10.75 KB | ||
| 002 DFS on trees.mp4 | 89.22 MB | ||
| 003 Print all ancestors in a tree.en.srt | 10.89 KB | ||
| 003 Print all ancestors in a tree.mp4 | 103.72 MB | ||
| 078 ancestor printing .cpp | 587 B | ||
| 17 Euler Tour | |||
| 001 Introduction.en.srt | 14.57 KB | ||
| 001 Introduction.mp4 | 141.94 MB | ||
| 002 Applications.en.srt | 29.17 KB | ||
| 002 Applications.mp4 | 290.49 MB | ||
| 003 Code.en.srt | 16.38 KB | ||
| 003 Code.mp4 | 157.9 MB | ||
| 080 euler tours.cpp | 706 B | ||
| 081 best euler tour | 1.1 KB | ||
| 18 LCA | |||
| 001 Introduction.en.srt | 17.91 KB | ||
| 001 Introduction.mp4 | 159.95 MB | ||
| 002 LCA (Brute Force).en.srt | 20.63 KB | ||
| 002 LCA (Brute Force).mp4 | 191.3 MB | ||
| 003 LCA using Binary Lifting.en.srt | 52.49 KB | ||
| 003 LCA using Binary Lifting.mp4 | 477.39 MB | ||
| 083 LCA using 2 pointers.cpp | 985 B | ||
| 084 LCA using sparse table.cpp | 1.5 KB | ||
| 19 Re-rooting of trees | |||
| 001 Introduction and brute force [TutFlix.ORG].mp4 | 190.66 MB | ||
| 001 Introduction and brute force.en [TutFlix.ORG].srt | 22.84 KB | ||
| 002 Approach to re root the tree [TutFlix.ORG].mp4 | 236.78 MB | ||
| 002 Approach to re root the tree.en [TutFlix.ORG].srt | 27.24 KB | ||
| 003 Code for re rooting of the tree [TutFlix.ORG].mp4 | 145.14 MB | ||
| 003 Code for re rooting of the tree.en [TutFlix.ORG].srt | 14.4 KB | ||
| 085 Re-rooting brrute force [TutFlix.ORG].cpp | 705 B | ||
| 087 re rooting [TutFlix.ORG].cpp | 1.34 KB | ||
| 20 Network Flow | |||
| 001 Introduction to Network.en.srt | 5.81 KB | ||
| 001 Introduction to Network.mp4 | 54.39 MB | ||
| 002 Introduction to Maximum Flow in a Network.en.srt | 12.29 KB | ||
| 002 Introduction to Maximum Flow in a Network.mp4 | 94.4 MB | ||
| 003 Residual Networks and Augmenting Paths.en.srt | 34.62 KB | ||
| 003 Residual Networks and Augmenting Paths.mp4 | 298.46 MB | ||
| 004 Ford-Fulkerson and Edmond-Karp Algorithm.en.srt | 34.16 KB | ||
| 004 Ford-Fulkerson and Edmond-Karp Algorithm.mp4 | 320.29 MB | ||
| 005 Dinic's Algorithm.en.srt | 34.58 KB | ||
| 005 Dinic's Algorithm.mp4 | 301.37 MB | ||
| 006 Dinic's Algorithm Code.en.srt | 42.44 KB | ||
| 006 Dinic's Algorithm Code.mp4 | 410.12 MB | ||
| 007 Applications of Max Flow as Maximum Bipartite Matching.en.srt | 31.24 KB | ||
| 007 Applications of Max Flow as Maximum Bipartite Matching.mp4 | 302.78 MB | ||
| 093 dinic's algprithm.cpp | 1.96 KB | ||
| 21 Bonus _ Graph + Data Structures | |||
| 001 Board Game.en.srt | 16.5 KB | ||
| 001 Board Game.mp4 | 104.37 MB | ||
| 002 Board Game Code.en.srt | 23.09 KB | ||
| 002 Board Game Code.mp4 | 107.84 MB | ||
| ▲ 211 total files | |||
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 , 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!
| torrent name | size | uploader | age | seed | leech |
|---|---|---|---|---|---|
| 1.2 GB | freecoursewb | 1 year | 1 | 1 | |
| 3.1 GB | freecoursewb | 3 years | 0 | 0 | |
| 3.1 GB | tutsnode | 3 years | 0 | 0 | |
| 2.9 GB | freecoursewb | 3 years | 0 | 0 | |
| 8.77 GB | cybil18 | 4 years | 3 | 0 |
All Comments