Other
[Udemy] Graph Theory Algorithms for Competitive Programming (2021) [En]
Torrent info
Torrent Files List
01 Introduction (Size: 11.18 GB) (Files: 211)
01 Introduction
001 Course Orientation!.en.srt
001 Course Orientation!.mp4
002 Q_A Section & Discord Community.html
02 Graph Representation
001 Graphs Introduction.en.srt
001 Graphs Introduction.mp4
002 Graph Applications.en.srt
002 Graph Applications.mp4
003 Graph Key Terms.en.srt
003 Graph Key Terms.mp4
004 Adjacency List Representation.en.srt
004 Adjacency List Representation.mp4
005 Adjacency List Representation with Node Class.en.srt
005 Adjacency List Representation with Node Class.mp4
006 Some Helpful Webinars [Optional].html
03 Breath First Search
001 Breadth First Search.en.srt
001 Breadth First Search.mp4
002 BFS Code.en.srt
002 BFS Code.mp4
003 BFS Shortest Path.en.srt
003 BFS Shortest Path.mp4
004 BFS Shortest Path Code.en.srt
004 BFS Shortest Path Code.mp4
005 Snakes and Ladder Solution.en.srt
005 Snakes and Ladder Solution.mp4
04 Depth First Search
001 DFS Concept.en.srt
001 DFS Concept.mp4
002 DFS Code.en.srt
002 DFS Code.mp4
003 Largest Island Solution.en.srt
003 Largest Island Solution.mp4
05 Cycle Detection
001 Cycle Detection in Undirected Graph.en.srt
001 Cycle Detection in Undirected Graph.mp4
002 Cycle Detection in Undirected Graph Code.en.srt
002 Cycle Detection in Undirected Graph Code.mp4
003 Directed Graph - Cycle Detection.en.srt
003 Directed Graph - Cycle Detection.mp4
004 Directed Graph - Cycle Detection Code.en.srt
004 Directed Graph - Cycle Detection Code.mp4
005 Bipartite Graph.en.srt
005 Bipartite Graph.mp4
006 Bipartite Graph Code.en.srt
006 Bipartite Graph Code.mp4
06 Directed Acyclic Graph
001 Directed Acyclic Graph & Topological Ordering.en.srt
001 Directed Acyclic Graph & Topological Ordering.mp4
002 Topological Sort Algorithm.en.srt
002 Topological Sort Algorithm.mp4
003 Topological Ordering BFS Code.en.srt
003 Topological Ordering BFS Code.mp4
004 Toplogical Order using DFS.en.srt
004 Toplogical Order using DFS.mp4
005 Topological Ordering using DFS Code.en.srt
005 Topological Ordering using DFS Code.mp4
07 Disjoint Set Union
001 Disjoint Set Union Introduction [TutFlix.ORG].mp4
001 Disjoint Set Union Introduction.en [TutFlix.ORG].srt
002 DSU Data Structure [TutFlix.ORG].mp4
002 DSU Data Structure.en [TutFlix.ORG].srt
003 DSU Implementation [TutFlix.ORG].mp4
003 DSU Implementation.en [TutFlix.ORG].srt
004 Union by Rank [TutFlix.ORG].mp4
004 Union by Rank.en [TutFlix.ORG].srt
005 Path Compression Optimisation [TutFlix.ORG].mp4
005 Path Compression Optimisation.en [TutFlix.ORG].srt
006 DSU Dry Run [TutFlix.ORG].mp4
006 DSU Dry Run.en [TutFlix.ORG].srt
08 Minimum Spanning Trees
001 DSU Data Structure - Union & Find Ops.en.srt
001 DSU Data Structure - Union & Find Ops.mp4
002 Introduction to Minimum Spanning Trees!.en.srt
002 Introduction to Minimum Spanning Trees!.mp4
003 Prim's Algorithm.en.srt
003 Prim's Algorithm.mp4
004 Prim's Code.en.srt
004 Prim's Code.mp4
005 Kruskal's Algorithm.en.srt
005 Kruskal's Algorithm.mp4
006 Kruskal's Code.en.srt
006 Kruskal's Code.mp4
09 Shortest Path Algorithms
001 Introduction to Shortest Path Algorithms.en.srt
001 Introduction to Shortest Path Algorithms.mp4
002 Dijkshtra's Algorithm.en.srt
002 Dijkshtra's Algorithm.mp4
003 Dijkshtra's Algorithm Code.en.srt
003 Dijkshtra's Algorithm Code.mp4
004 Bellman Ford Algorithm.en.srt
004 Bellman Ford Algorithm.mp4
005 Bellman Ford Code.en.srt
005 Bellman Ford Code.mp4
006 Floyd Warshall.en.srt
006 Floyd Warshall.mp4
007 Floyd Warshall Code.en.srt
007 Floyd Warshall Code.mp4
008 Solution - Shortest Path in Grid!.en.srt
008 Solution - Shortest Path in Grid!.mp4
10 Travelling Salesman Problem
001 Travelling Salesman Problem.en.srt
001 Travelling Salesman Problem.mp4
002 Travelling Salesman Intution.en.srt
002 Travelling Salesman Intution.mp4
003 TSP Brute Force.en.srt
003 TSP Brute Force.mp4
004 TSP DP + Bitmasking.en.srt
004 TSP DP + Bitmasking.mp4
11 Flood Fill
001 Flood Fill Introduction.en.srt
001 Flood Fill Introduction.mp4
002 Number of Islands.en.srt
002 Number of Islands.mp4
003 Coloring Islands.en.srt
003 Coloring Islands.mp4
004 Biggest Island.en.srt
004 Biggest Island.mp4
005 Make Largest island.en.srt
005 Make Largest island.mp4
053 Flood Fill Total connected Components.cpp
054 Flood fill color count.cpp
055 flood fill largest island.cpp
056 Flood Fill make largest island.cpp
12 Multi - Source BFS
001 Introduction to Multi Source BFS.en.srt
001 Introduction to Multi Source BFS.mp4
002 Problem on Multi Source BFS.en.srt
002 Problem on Multi Source BFS.mp4
003 Bonus Problem on Multi Source BFS.en.srt
003 Bonus Problem on Multi Source BFS.mp4
004 0_1 BFS.en.srt
004 0_1 BFS.mp4
058 Multi source BFS minimum operations .cpp
058 multisurce BFS (minimum distance).cpp
059 shortest path from first row to last row.cpp
13 DFS-Tree and Backedges
001 Introduction to DFS tree and Backedges.en.srt
001 Introduction to DFS tree and Backedges.mp4
002 DFS Tree and backedges in Undirected graph.en.srt
002 DFS Tree and backedges in Undirected graph.mp4
003 DFS Tree and Backedges in Directed and Undirectde graphs.en.srt
003 DFS Tree and Backedges in Directed and Undirectde graphs.mp4
004 Print cycle in a graph.en.srt
004 Print cycle in a graph.mp4
062 DFS tree and backedge code.cpp
063 DFS tree and backedges in Directed Graphs.cpp
064 print cycle in a graph.cpp
14 Articulation Points & Bridges
001 Introduction and definitions.en.srt
001 Introduction and definitions.mp4
002 Discovered Time.en.srt
002 Discovered Time.mp4
003 Lowest Time or Low Link.en.srt
003 Lowest Time or Low Link.mp4
004 Algorithm.en.srt
004 Algorithm.mp4
005 Coding the Algorithm.en.srt
005 Coding the Algorithm.mp4
069 articulation point and bridges.cpp
15 Strongly Connected Components
001 Introduction to Topological Order and Strongly Connected Components [TutFlix.ORG].mp4
001 Introduction to Topological Order and Strongly Connected Components.en [TutFlix.ORG].srt
002 Algorithm and Code to find Topological Ordering [TutFlix.ORG].mp4
002 Algorithm and Code to find Topological Ordering.en [TutFlix.ORG].srt
003 Introduction to Strongly Connected Component [TutFlix.ORG].mp4
003 Introduction to Strongly Connected Component.en [TutFlix.ORG].srt
004 Condensed Component Graph [TutFlix.ORG].mp4
004 Condensed Component Graph.en [TutFlix.ORG].srt
005 Kosaraju Algorithm for Strongly Connected Component [TutFlix.ORG].mp4
005 Kosaraju Algorithm for Strongly Connected Component.en [TutFlix.ORG].srt
006 Kosaraju Algorithm for Strongly Connected Component Code [TutFlix.ORG].mp4
006 Kosaraju Algorithm for Strongly Connected Component Code.en [TutFlix.ORG].srt
071 topological Order [TutFlix.ORG].cpp
075 kosaraju algorithm for SCC [TutFlix.ORG].cpp
16 Trees
001 Introduction and properties of trees.en.srt
001 Introduction and properties of trees.mp4
002 DFS on trees.en.srt
002 DFS on trees.mp4
003 Print all ancestors in a tree.en.srt
003 Print all ancestors in a tree.mp4
078 ancestor printing .cpp
17 Euler Tour
001 Introduction.en.srt
001 Introduction.mp4
002 Applications.en.srt
002 Applications.mp4
003 Code.en.srt
003 Code.mp4
080 euler tours.cpp
081 best euler tour
18 LCA
001 Introduction.en.srt
001 Introduction.mp4
002 LCA (Brute Force).en.srt
002 LCA (Brute Force).mp4
003 LCA using Binary Lifting.en.srt
003 LCA using Binary Lifting.mp4
083 LCA using 2 pointers.cpp
084 LCA using sparse table.cpp
19 Re-rooting of trees
001 Introduction and brute force [TutFlix.ORG].mp4
001 Introduction and brute force.en [TutFlix.ORG].srt
002 Approach to re root the tree [TutFlix.ORG].mp4
002 Approach to re root the tree.en [TutFlix.ORG].srt
003 Code for re rooting of the tree [TutFlix.ORG].mp4
003 Code for re rooting of the tree.en [TutFlix.ORG].srt
085 Re-rooting brrute force [TutFlix.ORG].cpp
087 re rooting [TutFlix.ORG].cpp
20 Network Flow
001 Introduction to Network.en.srt
001 Introduction to Network.mp4
002 Introduction to Maximum Flow in a Network.en.srt
002 Introduction to Maximum Flow in a Network.mp4
003 Residual Networks and Augmenting Paths.en.srt
003 Residual Networks and Augmenting Paths.mp4
004 Ford-Fulkerson and Edmond-Karp Algorithm.en.srt
004 Ford-Fulkerson and Edmond-Karp Algorithm.mp4
005 Dinic's Algorithm.en.srt
005 Dinic's Algorithm.mp4
006 Dinic's Algorithm Code.en.srt
006 Dinic's Algorithm Code.mp4
007 Applications of Max Flow as Maximum Bipartite Matching.en.srt
007 Applications of Max Flow as Maximum Bipartite Matching.mp4
093 dinic's algprithm.cpp
21 Bonus _ Graph + Data Structures
001 Board Game.en.srt
001 Board Game.mp4
002 Board Game Code.en.srt
002 Board Game Code.mp4
Torrent description
Feel free to post any comments about this torrent, including links to Subtitle, samples, screenshots, or any other relevant information, Watch [Udemy] Graph Theory Algorithms for Competitive Programming (2021) [En] Online Free Full Movies Like 123Movies, Putlockers, Fmovies, Netflix or Download Direct via Magnet Link in Torrent Details.
