| 01 - Introduction | |||
| 001 Course Orientation!.mp4 | 98.19 MB | ||
| 001 Course Orientation!_en.srt | 9.9 KB | ||
| 002 QA Section & Discord Community.html | 2.32 KB | ||
| 003 Graphs Code Repository C++ and Java!.html | 364 B | ||
| 004 Exercise Solutions - Code Repository!.html | 740 B | ||
| 005 Sharing Feedback.html | 220 B | ||
| 02 - Setting Up Sublime [optional] | |||
| 001 Sublime Setup.mp4 | 32.92 MB | ||
| 001 Sublime Setup_en.srt | 13.66 KB | ||
| 002 Adding Master Header File.mp4 | 32 MB | ||
| 002 Adding Master Header File_en.srt | 4.51 KB | ||
| 003 Escaping Online Judges.mp4 | 18.3 MB | ||
| 003 Escaping Online Judges_en.srt | 9.3 KB | ||
| 004 Common Code Snippets.mp4 | 13.3 MB | ||
| 004 Common Code Snippets_en.srt | 7.04 KB | ||
| 005 Using Macros.mp4 | 26.81 MB | ||
| 005 Using Macros_en.srt | 13.52 KB | ||
| 006 Example Code Explained.mp4 | 149.84 MB | ||
| 006 Example Code Explained_en.srt | 28 KB | ||
| 03 - Graph Representation | |||
| 001 Graphs Introduction.mp4 | 140.65 MB | ||
| 001 Graphs Introduction_en.srt | 16.93 KB | ||
| 002 Graph Applications.mp4 | 17.93 MB | ||
| 002 Graph Applications_en.srt | 7.97 KB | ||
| 003 Graph Key Terms.mp4 | 19.99 MB | ||
| 003 Graph Key Terms_en.srt | 12.4 KB | ||
| 004 Adjacency List Representation.mp4 | 16.57 MB | ||
| 004 Adjacency List Representation_en.srt | 10.14 KB | ||
| 005 Adjacency List Representation with Node Class.mp4 | 26.88 MB | ||
| 005 Adjacency List Representation with Node Class_en.srt | 10.52 KB | ||
| 006 Some Helpful Webinars [Optional].html | 366 B | ||
| GetFreeCourses.Co.url | 116 B | ||
| 04 - Breath First Search | |||
| 001 Breadth First Search.mp4 | 15.38 MB | ||
| 001 Breadth First Search_en.srt | 8.84 KB | ||
| 002 BFS Code.mp4 | 66.16 MB | ||
| 002 BFS Code_en.srt | 8.49 KB | ||
| 003 BFS Shortest Path.mp4 | 9.69 MB | ||
| 003 BFS Shortest Path_en.srt | 5.78 KB | ||
| 004 BFS Shortest Path Code.mp4 | 18.4 MB | ||
| 004 BFS Shortest Path Code_en.srt | 6.63 KB | ||
| 005 Snakes and Ladder Solution.mp4 | 101.13 MB | ||
| 005 Snakes and Ladder Solution_en.srt | 11.41 KB | ||
| 05 - Depth First Search | |||
| 001 DFS Concept.mp4 | 9.56 MB | ||
| 001 DFS Concept_en.srt | 5.6 KB | ||
| 002 DFS Code.mp4 | 16.85 MB | ||
| 002 DFS Code_en.srt | 6.71 KB | ||
| 003 Largest Island Solution.mp4 | 47.15 MB | ||
| 003 Largest Island Solution_en.srt | 16.07 KB | ||
| 06 - Cycle Detection | |||
| 001 Cycle Detection in Undirected Graph.mp4 | 9.04 MB | ||
| 001 Cycle Detection in Undirected Graph_en.srt | 5.01 KB | ||
| 002 Cycle Detection in Undirected Graph Code.mp4 | 26.67 MB | ||
| 002 Cycle Detection in Undirected Graph Code_en.srt | 10.25 KB | ||
| 003 Directed Graph - Cycle Detection.mp4 | 22.15 MB | ||
| 003 Directed Graph - Cycle Detection_en.srt | 12.27 KB | ||
| 004 Directed Graph - Cycle Detection Code.mp4 | 32.86 MB | ||
| 004 Directed Graph - Cycle Detection Code_en.srt | 15.2 KB | ||
| 005 Bipartite Graph.mp4 | 13.86 MB | ||
| 005 Bipartite Graph_en.srt | 9.74 KB | ||
| 006 Bipartite Graph Code.mp4 | 33.1 MB | ||
| 006 Bipartite Graph Code_en.srt | 15.96 KB | ||
| 07 - Directed Acyclic Graph | |||
| 001 Directed Acyclic Graph & Topological Ordering.mp4 | 17.99 MB | ||
| 001 Directed Acyclic Graph & Topological Ordering_en.srt | 5.73 KB | ||
| 002 Topological Sort Algorithm.mp4 | 11.05 MB | ||
| 002 Topological Sort Algorithm_en.srt | 6.68 KB | ||
| 003 Topological Ordering BFS Code.mp4 | 12.85 MB | ||
| 003 Topological Ordering BFS Code_en.srt | 6.79 KB | ||
| 004 Toplogical Order using DFS.mp4 | 53.5 MB | ||
| 004 Toplogical Order using DFS_en.srt | 6.59 KB | ||
| 005 Topological Ordering using DFS Code.mp4 | 13.9 MB | ||
| 005 Topological Ordering using DFS Code_en.srt | 5.34 KB | ||
| 08 - Disjoint Set Union | |||
| 001 Disjoint Set Union Introduction.mp4 | 10.24 MB | ||
| 001 Disjoint Set Union Introduction_en.srt | 5.36 KB | ||
| 002 DSU Data Structure - Union & Find Ops.mp4 | 18.98 MB | ||
| 002 DSU Data Structure - Union & Find Ops_en.srt | 11 KB | ||
| 003 DSU Data Structure.mp4 | 15.07 MB | ||
| 003 DSU Data Structure_en.srt | 8.33 KB | ||
| 004 DSU Implementation.mp4 | 32 MB | ||
| 004 DSU Implementation_en.srt | 14.28 KB | ||
| 005 Union by Rank.mp4 | 30.67 MB | ||
| 005 Union by Rank_en.srt | 10.81 KB | ||
| 006 Path Compression Optimisation.mp4 | 22.54 MB | ||
| 006 Path Compression Optimisation_en.srt | 10.28 KB | ||
| 007 DSU Dry Run.mp4 | 40.49 MB | ||
| 007 DSU Dry Run_en.srt | 15.01 KB | ||
| GetFreeCourses.Co.url | 116 B | ||
| 09 - Minimum Spanning Trees | |||
| 001 Introduction to Minimum Spanning Trees!.mp4 | 31.46 MB | ||
| 001 Introduction to Minimum Spanning Trees!_en.srt | 4.77 KB | ||
| 002 Prim's Algorithm.mp4 | 35.55 MB | ||
| 002 Prim's Algorithm_en.srt | 23.9 KB | ||
| 003 Prim's Code.mp4 | 57.48 MB | ||
| 003 Prim's Code_en.srt | 20.76 KB | ||
| 004 Kruskal's Algorithm.mp4 | 18.11 MB | ||
| 004 Kruskal's Algorithm_en.srt | 10.98 KB | ||
| 005 Kruskal's Code.mp4 | 33.58 MB | ||
| 005 Kruskal's Code_en.srt | 14.67 KB | ||
| 10 - Shortest Path Algorithms | |||
| 001 Introduction to Shortest Path Algorithms.mp4 | 18.94 MB | ||
| 001 Introduction to Shortest Path Algorithms_en.srt | 11.16 KB | ||
| 002 Dijkshtra's Algorithm.mp4 | 96.14 MB | ||
| 002 Dijkshtra's Algorithm_en.srt | 12.43 KB | ||
| 003 Dijkshtra's Algorithm Code.mp4 | 46.58 MB | ||
| 003 Dijkshtra's Algorithm Code_en.srt | 18.43 KB | ||
| 004 Bellman Ford Algorithm.mp4 | 62.43 MB | ||
| 004 Bellman Ford Algorithm_en.srt | 40.34 KB | ||
| 005 Bellman Ford Code.mp4 | 16.15 MB | ||
| 005 Bellman Ford Code_en.srt | 9.71 KB | ||
| 006 Floyd Warshall.mp4 | 221.95 MB | ||
| 006 Floyd Warshall_en.srt | 37.88 KB | ||
| 007 Floyd Warshall Code.mp4 | 25.61 MB | ||
| 007 Floyd Warshall Code_en.srt | 9.18 KB | ||
| 008 Solution - Shortest Path in Grid!.mp4 | 38.16 MB | ||
| 008 Solution - Shortest Path in Grid!_en.srt | 15.12 KB | ||
| 11 - Travelling Salesman Problem | |||
| 001 Travelling Salesman Problem.mp4 | 34.78 MB | ||
| 001 Travelling Salesman Problem_en.srt | 14.96 KB | ||
| 002 Travelling Salesman Intution.mp4 | 11.03 MB | ||
| 002 Travelling Salesman Intution_en.srt | 4.84 KB | ||
| 003 TSP Brute Force.mp4 | 39.93 MB | ||
| 003 TSP Brute Force_en.srt | 14.66 KB | ||
| 004 TSP DP + Bitmasking.mp4 | 9.32 MB | ||
| 004 TSP DP + Bitmasking_en.srt | 3.53 KB | ||
| 12 - Flood Fill | |||
| 001 Flood Fill Introduction.mp4 | 40.52 MB | ||
| 001 Flood Fill Introduction_en.srt | 7.18 KB | ||
| 002 Flood-Fill-Total-connected-Components.cpp | 757 B | ||
| 002 Number of Islands.mp4 | 195.45 MB | ||
| 002 Number of Islands_en.srt | 23.33 KB | ||
| 003 Coloring Islands.mp4 | 25.27 MB | ||
| 003 Coloring Islands_en.srt | 8.72 KB | ||
| 003 Flood-fill-color-count.cpp | 1.04 KB | ||
| 004 Biggest Island.mp4 | 15.95 MB | ||
| 004 Biggest Island_en.srt | 4.46 KB | ||
| 004 flood-fill-largest-island.cpp | 1.41 KB | ||
| 005 Flood-Fill-make-largest-island.cpp | 1.41 KB | ||
| 005 Make Largest island.mp4 | 174.8 MB | ||
| 005 Make Largest island_en.srt | 24.15 KB | ||
| GetFreeCourses.Co.url | 116 B | ||
| 13 - Multi - Source BFS | |||
| 001 Introduction to Multi Source BFS.mp4 | 79.21 MB | ||
| 001 Introduction to Multi Source BFS_en.srt | 14.85 KB | ||
| 002 Multi-source-BFS-minimum-operations.cpp | 1.06 KB | ||
| 002 Problem on Multi Source BFS.mp4 | 190.56 MB | ||
| 002 Problem on Multi Source BFS_en.srt | 25.96 KB | ||
| 002 multisurce-BFS-minimum-distance.cpp | 1.06 KB | ||
| 003 Bonus Problem on Multi Source BFS.mp4 | 105.21 MB | ||
| 003 Bonus Problem on Multi Source BFS_en.srt | 21.92 KB | ||
| 003 shortest-path-from-first-row-to-last-row.cpp | 1.26 KB | ||
| 004 01 BFS.mp4 | 48.54 MB | ||
| 004 01 BFS_en.srt | 9.94 KB | ||
| 14 - DFS-Tree and Backedges | |||
| 001 Introduction to DFS tree and Backedges.mp4 | 30.69 MB | ||
| 001 Introduction to DFS tree and Backedges_en.srt | 12.59 KB | ||
| 002 DFS Tree and backedges in Undirected graph.mp4 | 103.49 MB | ||
| 002 DFS Tree and backedges in Undirected graph_en.srt | 23.34 KB | ||
| 002 DFS-tree-and-backedge-code.cpp | 668 B | ||
| 003 DFS Tree and Backedges in Directed and Undirectde graphs.mp4 | 213.67 MB | ||
| 003 DFS Tree and Backedges in Directed and Undirectde graphs_en.srt | 30.64 KB | ||
| 003 DFS-tree-and-backedges-in-Directed-Graphs.cpp | 793 B | ||
| 004 Print cycle in a graph.mp4 | 72.32 MB | ||
| 004 Print cycle in a graph_en.srt | 13.67 KB | ||
| 004 print-cycle-in-a-graph.cpp | 940 B | ||
| 15 - Articulation Points & Bridges | |||
| 001 Introduction and definitions.mp4 | 52.3 MB | ||
| 001 Introduction and definitions_en.srt | 17.58 KB | ||
| 002 Discovered Time.mp4 | 70.27 MB | ||
| 002 Discovered Time_en.srt | 16.09 KB | ||
| 003 Lowest Time or Low Link.mp4 | 205.1 MB | ||
| 003 Lowest Time or Low Link_en.srt | 33.13 KB | ||
| 004 Algorithm.mp4 | 105.49 MB | ||
| 004 Algorithm_en.srt | 24.82 KB | ||
| 005 Coding the Algorithm.mp4 | 147.1 MB | ||
| 005 Coding the Algorithm_en.srt | 22.55 KB | ||
| 005 articulation-point-and-bridges.cpp | 1.13 KB | ||
| 16 - Strongly Connected Components | |||
| 001 Introduction to Topological Order and Strongly Connected Components.mp4 | 110.64 MB | ||
| 001 Introduction to Topological Order and Strongly Connected Components_en.srt | 24.75 KB | ||
| 002 Algorithm and Code to find Topological Ordering.mp4 | 118.82 MB | ||
| 002 Algorithm and Code to find Topological Ordering_en.srt | 26.75 KB | ||
| 002 topological-Order.cpp | 672 B | ||
| 003 Introduction to Strongly Connected Component.mp4 | 59.1 MB | ||
| 003 Introduction to Strongly Connected Component_en.srt | 13.69 KB | ||
| 004 Condensed Component Graph.mp4 | 36.85 MB | ||
| 004 Condensed Component Graph_en.srt | 16.72 KB | ||
| 005 Kosaraju Algorithm for Strongly Connected Component.mp4 | 202.63 MB | ||
| 005 Kosaraju Algorithm for Strongly Connected Component_en.srt | 39.94 KB | ||
| 006 Kosaraju Algorithm for Strongly Connected Component Code.mp4 | 91.2 MB | ||
| 006 Kosaraju Algorithm for Strongly Connected Component Code_en.srt | 13.27 KB | ||
| 006 kosaraju-algorithm-for-SCC.cpp | 1.06 KB | ||
| 17 - Trees | |||
| 001 Introduction and properties of trees.mp4 | 237.7 MB | ||
| 001 Introduction and properties of trees_en.srt | 30.99 KB | ||
| 002 DFS on trees.mp4 | 30.47 MB | ||
| 002 DFS on trees_en.srt | 10.29 KB | ||
| 003 Print all ancestors in a tree.mp4 | 103.35 MB | ||
| 003 Print all ancestors in a tree_en.srt | 10.43 KB | ||
| 003 ancestor-printing.cpp | 587 B | ||
| GetFreeCourses.Co.url | 116 B | ||
| 18 - Euler Tour | |||
| 001 Introduction.mp4 | 89.29 MB | ||
| 001 Introduction_en.srt | 13.92 KB | ||
| 002 Applications.mp4 | 290.49 MB | ||
| 002 Applications_en.srt | 27.91 KB | ||
| 002 euler-tours.cpp | 706 B | ||
| 003 Code.mp4 | 37.8 MB | ||
| 003 Code_en.srt | 15.7 KB | ||
| 003 best-euler-tour | 1.1 KB | ||
| 19 - LCA | |||
| 001 Introduction.mp4 | 99.65 MB | ||
| 001 Introduction_en.srt | 17.13 KB | ||
| 002 LCA (Brute Force).mp4 | 77.1 MB | ||
| 002 LCA (Brute Force)_en.srt | 19.75 KB | ||
| 002 LCA-using-2-pointers.cpp | 985 B | ||
| 003 LCA using Binary Lifting.mp4 | 396.55 MB | ||
| 003 LCA using Binary Lifting_en.srt | 50.24 KB | ||
| 003 LCA-using-sparse-table.cpp | 1.5 KB | ||
| 20 - Re-rooting of trees | |||
| 001 Introduction and brute force.mp4 | 120.96 MB | ||
| 001 Introduction and brute force_en.srt | 21.9 KB | ||
| 001 Re-rooting-brrute-force.cpp | 705 B | ||
| 002 Approach to re root the tree.mp4 | 233.97 MB | ||
| 002 Approach to re root the tree_en.srt | 26.13 KB | ||
| 003 Code for re rooting of the tree.mp4 | 88.45 MB | ||
| 003 Code for re rooting of the tree_en.srt | 13.81 KB | ||
| 003 re-rooting.cpp | 1.34 KB | ||
| 21 - Dynamic Programming On Trees | |||
| 001 DP introduction.mp4 | 25.09 MB | ||
| 001 DP introduction_en.srt | 8.24 KB | ||
| 002 Vertex Cover (greedy).mp4 | 39.26 MB | ||
| 002 Vertex Cover (greedy)_en.srt | 13.51 KB | ||
| 003 Definitions and Rules.mp4 | 90.93 MB | ||
| 003 Definitions and Rules_en.srt | 11.63 KB | ||
| 004 Vertex Cover DP.mp4 | 106.61 MB | ||
| 004 Vertex Cover DP_en.srt | 22.2 KB | ||
| 005 DP code (Recursion + Memoisation).mp4 | 84.02 MB | ||
| 005 DP code (Recursion + Memoisation)_en.srt | 14.27 KB | ||
| 005 vertex-cover-spoj-dp.cpp | 794 B | ||
| 006 DP on trees using DFS.mp4 | 22.04 MB | ||
| 006 DP on trees using DFS_en.srt | 7.89 KB | ||
| 006 vertex-cover-dfs.cpp | 676 B | ||
| 007 DP on trees using bfs.mp4 | 80.35 MB | ||
| 007 DP on trees using bfs_en.srt | 11.21 KB | ||
| 007 vertex-cover-spoj-bfs.cpp | 877 B | ||
| 008 Tree Diameter CSES.mp4 | 135.32 MB | ||
| 008 Tree Diameter CSES_en.srt | 21.04 KB | ||
| 009 Tree Diameter (code).mp4 | 56.76 MB | ||
| 009 Tree Diameter (code)_en.srt | 13.54 KB | ||
| 009 diameter-code.cpp | 792 B | ||
| 010 Nitpick.mp4 | 4.81 MB | ||
| 010 Nitpick_en.srt | 2.1 KB | ||
| 010 diameter-code.cpp | 792 B | ||
| 011 Distance Tree 1.mp4 | 203.35 MB | ||
| 011 Distance Tree 1_en.srt | 30.75 KB | ||
| 012 Distance Tree (code).mp4 | 164.23 MB | ||
| 012 Distance Tree (code)_en.srt | 23.28 KB | ||
| 013 Try These.html | 96 B | ||
| 22 - Network Flow | |||
| 001 Introduction to Network.mp4 | 12.83 MB | ||
| 001 Introduction to Network_en.srt | 5.59 KB | ||
| 002 Introduction to Maximum Flow in a Network.mp4 | 62.47 MB | ||
| 002 Introduction to Maximum Flow in a Network_en.srt | 11.77 KB | ||
| 003 Residual Networks and Augmenting Paths.mp4 | 247.64 MB | ||
| 003 Residual Networks and Augmenting Paths_en.srt | 33.22 KB | ||
| 004 Ford-Fulkerson and Edmond-Karp Algorithm.mp4 | 264.2 MB | ||
| 004 Ford-Fulkerson and Edmond-Karp Algorithm_en.srt | 32.7 KB | ||
| 005 Dinic's Algorithm.mp4 | 250.26 MB | ||
| 005 Dinic's Algorithm_en.srt | 33.18 KB | ||
| 006 Dinic's Algorithm Code.mp4 | 339.83 MB | ||
| 006 Dinic's Algorithm Code_en.srt | 40.69 KB | ||
| 006 dinics-algprithm.cpp | 1.96 KB | ||
| 007 Applications of Max Flow as Maximum Bipartite Matching.mp4 | 302.03 MB | ||
| 007 Applications of Max Flow as Maximum Bipartite Matching_en.srt | 29.96 KB | ||
| 23 - Bonus Graph + Data Structures | |||
| 001 Board Game.mp4 | 29.73 MB | ||
| 001 Board Game_en.srt | 15.83 KB | ||
| 002 Board Game Code.mp4 | 60.44 MB | ||
| 002 Board Game Code_en.srt | 22.17 KB | ||
| Download Paid Udemy Courses For Free.url | 116 B | ||
| GetFreeCourses.Co.url | 116 B | ||
| ▲ 262 total files | |||
Graph Theory Algorithms for Competitive Programming (2022)
Learn Graphs Algorithms in Computer Science & Mathematics, theory + hands-on coding and ace Competitive Coding problems!
Udemy Link - https://www.udemy.com/course/graph-theory-algorithms-for-competitive-programming/
Please seed as much as you can!
| 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 | |
| 2.2 GB | freecoursewb | 4 years | 0 | 0 |
All Comments