Этот материал находится в платной подписке. Оформи премиум подписку и смотри или слушай Graph Theory Algorithms for Competitive Programming, а также все другие курсы, прямо сейчас!
• Урок 1. 00:07:03
Course Orientation!
• Урок 2. 00:12:05
Graphs Introduction
• Урок 3. 00:05:49
Graph Applications
• Урок 4. 00:09:08
Graph Key Terms
• Урок 5. 00:08:43
• Урок 6. 00:09:09
Adjacency List Representation with Node Class
• Урок 7. 00:06:44
• Урок 8. 00:07:16
BFS Code
• Урок 9. 00:04:31
BFS Shortest Path
• Урок 10. 00:06:11
BFS Shortest Path Code
• Урок 11. 00:08:25
• Урок 12. 00:04:19
DFS Concept
• Урок 13. 00:05:41
DFS Code
• Урок 14. 00:12:31
Largest Island Solution
• Урок 15. 00:03:35
Cycle Detection in Undirected Graph
• Урок 16. 00:08:59
Cycle Detection in Undirected Graph Code
• Урок 17. 00:08:56
Directed Graph - Cycle Detection
• Урок 18. 00:12:47
Directed Graph - Cycle Detection Code
• Урок 19. 00:07:15
Bipartite Graph
• Урок 20. 00:12:26
Bipartite Graph Code
• Урок 21. 00:04:35
Directed Acyclic Graph & Topological Ordering
• Урок 22. 00:04:51
Topological Sort Algorithm
• Урок 23. 00:05:56
Topological Ordering BFS Code
• Урок 24. 00:04:52
Toplogical Order using DFS
• Урок 25. 00:05:07
Topological Ordering using DFS Code
• Урок 26. 00:04:20
Disjoint Set Union Introduction
• Урок 27. 00:09:02
DSU Data Structure - Union & Find Ops
• Урок 28. 00:07:07
DSU Data Structure
• Урок 29. 00:13:17
DSU Implementation
• Урок 30. 00:10:16
Union by Rank
• Урок 31. 00:08:39
Path Compression Optimisation
• Урок 32. 00:13:15
DSU Dry Run
• Урок 33. 00:03:38
Introduction to Minimum Spanning Trees!
• Урок 34. 00:19:33
Prim's Algorithm
• Урок 35. 00:18:43
Prim's Code
• Урок 36. 00:08:59
Kruskal's Algorithm
• Урок 37. 00:13:38
Kruskal's Code
• Урок 38. 00:07:53
Introduction to Shortest Path Algorithms
• Урок 39. 00:09:12
Dijkshtra's Algorithm
• Урок 40. 00:14:55
Dijkshtra's Algorithm Code
• Урок 41. 00:33:09
Bellman Ford Algorithm
• Урок 42. 00:09:12
Bellman Ford Code
• Урок 43. 00:29:35
Floyd Warshall
• Урок 44. 00:08:38
Floyd Warshall Code
• Урок 45. 00:12:21
Solution - Shortest Path in Grid!
• Урок 46. 00:12:04
Travelling Salesman Problem
• Урок 47. 00:03:43
Travelling Salesman Intution
• Урок 48. 00:12:26
TSP Brute Force
• Урок 49. 00:02:44
• Урок 50. 00:05:32
Flood Fill Introduction
• Урок 51. 00:18:19
Number of Islands
• Урок 52. 00:07:01
Coloring Islands
• Урок 53. 00:03:30
Biggest Island
• Урок 54. 00:19:01
Make Largest island
• Урок 55. 00:12:12
Introduction to Multi Source BFS
• Урок 56. 00:19:46
Problem on Multi Source BFS
• Урок 57. 00:15:51
Bonus Problem on Multi Source BFS
• Урок 58. 00:07:41
0/1 BFS
• Урок 59. 00:09:07
Introduction to DFS tree and Backedges
• Урок 60. 00:16:41
DFS Tree and backedges in Undirected graph
• Урок 61. 00:23:12
DFS Tree and Backedges in Directed and Undirectde graphs
• Урок 62. 00:10:04
Print cycle in a graph
• Урок 63. 00:12:27
Introduction and definitions
• Урок 64. 00:11:33
Discovered Time
• Урок 65. 00:24:48
• Урок 66. 00:19:20
Algorithm
• Урок 67. 00:17:18
Coding the Algorithm
• Урок 68. 00:18:42
Introduction to Topological Order and Strongly Connected Components
• Урок 69. 00:20:43
Algorithm and Code to find Topological Ordering
• Урок 70. 00:09:51
Introduction to Strongly Connected Component
• Урок 71. 00:12:51
Condensed Component Graph
• Урок 72. 00:30:06
Kosaraju Algorithm for Strongly Connected Component
• Урок 73. 00:11:47
Kosaraju Algorithm for Strongly Connected Component Code
• Урок 74. 00:24:27
Introduction and properties of trees
• Урок 75. 00:08:03
DFS on trees
• Урок 76. 00:08:36
Print all ancestors in a tree
• Урок 77. 00:11:24
Introduction
• Урок 78. 00:21:51
Applications
• Урок 79. 00:13:04
Code
• Урок 80. 00:12:37
Introduction
• Урок 81. 00:16:12
LCA (Brute Force)
• Урок 82. 00:38:43
LCA using Binary Lifting
• Урок 83. 00:15:52
Introduction and brute force
• Урок 84. 00:20:21
Approach to re root the tree
• Урок 85. 00:11:13
Code for re rooting of the tree
• Урок 86. 00:04:13
Introduction to Network
• Урок 87. 00:08:40
Introduction to Maximum Flow in a Network
• Урок 88. 00:26:27
Residual Networks and Augmenting Paths
• Урок 89. 00:26:24
Ford-Fulkerson and Edmond-Karp Algorithm
• Урок 90. 00:25:19
Dinic's Algorithm
• Урок 91. 00:33:21
Dinic's Algorithm Code
• Урок 92. 00:23:36
Applications of Max Flow as Maximum Bipartite Matching
• Урок 93. 00:12:12
Board Game
• Урок 94. 00:19:31
Board Game Code