Udemy - Graph Theory Algorithms For Competitive Programming 2022

Udemy.Graph.Theory.Algorithms.for.Competitive.Programming.2022-UDUMMY
Title:   Graph Theory Algorithms for Competitive Programming (2022)
URL:     https://www.udemy.com/course/graph-theory-algorithms-for-competitive-programming/
Length:  21:03:39
Subs:    en-IN
Notes:
------
Headline:
---------
Learn Graphs Algorithms in Computer Science & Mathematics, theory + hands-on coding and ace Competitive Coding problems!
Contents:
---------
1. Introduction
 - 1. Course Orientation! => 07:02
 - 2. Q/A Section & Discord Community => Article (not included)
 - 3. Graphs Code Repository C++ and Java! => Article (not included)
 - 4. Exercise Solutions - Code Repository! => Article (not included)
 - 5. Sharing Feedback => Article (not included)
2. Setting Up Sublime [optional]
 - 6. Sublime Setup => 09:46
 - 7. Adding Master Header File => 03:14
 - 8. Escaping Online Judges => 06:47
 - 9. Common Code Snippets => 04:53
 - 10. Using Macros => 09:50
 - 11. Example Code Explained => 18:05
3. Graph Representation
 - 12. Graphs Introduction => 12:04
 - 13. Graph Applications => 05:48
 - 14. Graph Key Terms => 09:07
 - 15. Adjacency List Representation => 08:42
 - 16. Adjacency List Representation with Node Class => 09:08
 - 17. Some Helpful Webinars [Optional] => Article (not included)
4. Breath First Search
 - 18. Breadth First Search => 06:43
 - 19. BFS Code => 07:15
 - 20. BFS Shortest Path => 04:30
 - 21. BFS Shortest Path Code => 06:10
 - 22. Snakes and Ladder Solution => 08:24
5. Depth First Search
 - 23. DFS Concept => 04:18
 - 24. DFS Code => 05:40
 - 25. Largest Island Solution => 12:29
6. Cycle Detection
 - 26. Cycle Detection in Undirected Graph => 03:34
 - 27. Cycle Detection in Undirected Graph Code => 08:58
 - 28. Directed Graph - Cycle Detection => 08:55
 - 29. Directed Graph - Cycle Detection Code => 12:46
 - 30. Bipartite Graph => 07:14
 - 31. Bipartite Graph Code => 12:25
7. Directed Acyclic Graph
 - 32. Directed Acyclic Graph & Topological Ordering => 04:34
 - 33. Topological Sort Algorithm => 04:50
 - 34. Topological Ordering BFS Code => 05:55
 - 35. Toplogical Order using DFS => 04:51
 - 36. Topological Ordering using DFS Code => 05:06
8. Disjoint Set Union
 - 37. Disjoint Set Union Introduction => 04:19
 - 38. DSU Data Structure - Union & Find Ops => 09:01
 - 39. DSU Data Structure => 07:06
 - 40. DSU Implementation => 13:16
 - 41. Union by Rank => 10:15
 - 42. Path Compression Optimisation => 08:38
 - 43. DSU Dry Run => 13:14
9. Minimum Spanning Trees
 - 44. Introduction to Minimum Spanning Trees! => 03:37
 - 45. Prim's Algorithm => 19:32
 - 46. Prim's Code => 18:42
 - 47. Kruskal's Algorithm => 08:58
 - 48. Kruskal's Code => 13:37
10. Shortest Path Algorithms
 - 49. Introduction to Shortest Path Algorithms => 07:52
 - 50. Dijkshtra's Algorithm => 09:11
 - 51. Dijkshtra's Algorithm Code => 14:53
 - 52. Bellman Ford Algorithm => 33:08
 - 53. Bellman Ford Code => 09:10
 - 54. Floyd Warshall => 29:34
 - 55. Floyd Warshall Code => 08:37
 - 56. Solution - Shortest Path in Grid! => 12:20
11. Travelling Salesman Problem
 - 57. Travelling Salesman Problem => 12:03
 - 58. Travelling Salesman Intution => 03:42
 - 59. TSP Brute Force => 12:25
 - 60. TSP DP + Bitmasking => 02:43
12. Flood Fill
 - 61. Flood Fill Introduction => 05:31
 - 62. Number of Islands => 18:18
 - 63. Coloring Islands => 07:00
 - 64. Biggest Island => 03:29
 - 65. Make Largest island => 19:00
13. Multi - Source BFS
 - 66. Introduction to Multi Source BFS => 12:11
 - 67. Problem on Multi Source BFS => 19:45
 - 68. Bonus Problem on Multi Source BFS => 15:50
 - 69. 0/1 BFS => 07:40
14. DFS-Tree and Backedges
 - 70. Introduction to DFS tree and Backedges => 09:06
 - 71. DFS Tree and backedges in Undirected graph => 16:40
 - 72. DFS Tree and Backedges in Directed and Undirectde graphs => 23:11
 - 73. Print cycle in a graph => 10:03
15. Articulation Points & Bridges
 - 74. Introduction and definitions => 12:26
 - 75. Discovered Time => 11:32
 - 76. Lowest Time or Low Link => 24:47
 - 77. Algorithm => 19:19
 - 78. Coding the Algorithm => 17:17
16. Strongly Connected Components
 - 79. Introduction to Topological Order and Strongly Connected Components => 18:41
 - 80. Algorithm and Code to find Topological Ordering => 20:41
 - 81. Introduction to Strongly Connected Component => 09:50
 - 82. Condensed Component Graph => 12:50
 - 83. Kosaraju Algorithm for Strongly Connected Component => 30:05
 - 84. Kosaraju Algorithm for Strongly Connected Component Code => 11:46
17. Trees
 - 85. Introduction and properties of trees => 24:26
 - 86. DFS on trees => 08:02
 - 87. Print all ancestors in a tree => 08:35
18. Euler Tour
 - 88. Introduction => 11:23
 - 89. Applications => 21:50
 - 90. Code => 13:03
19. LCA
 - 91. Introduction => 12:36
 - 92. LCA (Brute Force) => 16:11
 - 93. LCA using Binary Lifting => 38:42
20. Re-rooting of trees
 - 94. Introduction and brute force => 15:51
 - 95. Approach to re root the tree => 20:20
 - 96. Code for re rooting of the tree => 11:12
21. Network Flow
 - 97. Introduction to Network => 04:12
 - 98. Introduction to Maximum Flow in a Network => 08:39
 - 99. Residual Networks and Augmenting Paths => 26:26
 - 100. Ford-Fulkerson and Edmond-Karp Algorithm => 26:23
 - 101. Dinic's Algorithm => 25:18
 - 102. Dinic's Algorithm Code => 33:20
 - 103. Applications of Max Flow as Maximum Bipartite Matching => 23:35
22. Bonus : Graph + Data Structures
 - 104. Board Game => 12:11
 - 105. Board Game Code => 19:30

https://rapidgator.net/file/c192daaf9cbac6ee423f535d6fe1dba8/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part01.rar
https://rapidgator.net/file/2226ce2c78a75291ae6605a2beb3f4f7/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part02.rar
https://rapidgator.net/file/ee6fb5b7bb9f6d89134e6edec982ef8c/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part03.rar
https://rapidgator.net/file/dc668a99c478f314335d2f3b6829d9ec/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part04.rar
https://rapidgator.net/file/e54c4909c37cbff6690a2e9389601515/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part05.rar
https://rapidgator.net/file/2bd03ca42c91c5f69145eae7d550c333/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part06.rar
https://rapidgator.net/file/872f1bc1d25304c0d65cb4cc7fcd57ae/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part07.rar
https://rapidgator.net/file/94e858928d1d3de5d203f89ee61e5598/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part08.rar
https://rapidgator.net/file/4fdb9cab5bba0437ede79b45b7230605/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part09.rar
https://rapidgator.net/file/f423515b848b73d60a7045c016cb1832/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part10.rar
https://rapidgator.net/file/7ceb9f1a52a3c736375dde3f0d774bbb/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part11.rar
https://rapidgator.net/file/f8cc49a4db8e73dee32c277965b5e964/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part12.rar
https://rapidgator.net/file/69ff6a080bbc71a8d7b1a1a4677f9dc2/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part13.rar
https://rapidgator.net/file/769010cc535ee4bdd158d0f3844c6957/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part14.rar

https://nitroflare.com/view/1F12DCA25EE4093/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part01.rar
https://nitroflare.com/view/59E6B76A879A9B4/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part02.rar
https://nitroflare.com/view/5170CBCDFC89027/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part03.rar
https://nitroflare.com/view/7823885F91BFDE7/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part04.rar
https://nitroflare.com/view/DF2F37FF9D96A16/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part05.rar
https://nitroflare.com/view/4CF98C63EF726D7/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part06.rar
https://nitroflare.com/view/8A3608CE7CBA3C6/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part07.rar
https://nitroflare.com/view/A23B227862B7E0C/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part08.rar
https://nitroflare.com/view/3553D6C5B90239B/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part09.rar
https://nitroflare.com/view/4C073B1ECB3283C/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part10.rar
https://nitroflare.com/view/279646401EF61AD/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part11.rar
https://nitroflare.com/view/CA52B18B5725386/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part12.rar
https://nitroflare.com/view/E21BD3C5973EA19/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part13.rar
https://nitroflare.com/view/016CF55F52428F4/udemy.graph.theory.algorithms.for.competitive.programming.2022-udummy.part14.rar