Guest
Points & Bridges\ 22:06 Algorithm 41:25 Coding the Algorithm Connected Components\ 58:42 Introduction to Topological Order and Strongly Connected Components 1:17:24 Algorithm and Code to find Topological Ordering 1:38:06 Introduction to Strongly Connected Component 1:47:56 Condensed Component Graph 2:00:47 Kosaraju Algorithm for Strongly Connected Component 2:30:53 Kosaraju Algorithm for Strongly Connected Component Code \ 2:42:39 Introduction and properties of trees 3:07:05 DFS on trees 3:15:07 Print all ancestors in a tree Tour\ 3:23:43 Introduction 3:35:07 Applications 3:56:57 Code \ 4:10:01 Introduction 4:22:38 LCA (Brute Force) 4:38:50 LCA using Binary Lifting of trees\ 5:17:32 Introduction and brute force 5:33:23 Approach to re root the tree 5:53:43 Code for re rooting of the tree Programming On Trees\ 6:04:56 DP introduction 6:10:11 Vertex Cover (greedy) 6:18:47 Definitions and Rules 6:26:58 Vertex Cover DP 6:41:12 DP code (Recursion Memoisation) 6:51:19 DP on trees using DFS 6:56:51 DP on trees using bfs 7:04:34 Tree Diameter CSES 7:19:24 Tree Diameter (code) 7:28:32 Nitpick 7:29:54 Distance Tree 1 7:51:51 Distance Tree (code) Flow\ 8:07:48 Introduction to Network 8:12:01 Introduction to Maximum Flow in a Network 8:20:41 Residual Networks and Augmenting Paths 8:47:07 Ford-Fulkerson and Edmond-Karp Algorithm 9:13:31 Dinic’s Algorithm 9:38:50 Dinic’s Algorithm Code 10:12:10 Applications of Max Flow as Maximum Bipartite Matching Graph Data Structures\ 10:35:46 Board Game 10:47:58 Board Game Code
