589689.xyz

Udemy - Advanced Algorithms in Java

  • 收录时间:2019-11-16 22:47:19
  • 文件大小:3GB
  • 下载次数:28
  • 最近下载:2020-12-31 07:55:15
  • 磁力链接:
立即下载 复制链接

文件列表

  1. 1. Introduction/2. Graph theory introduction.mp4 103MB
  2. 1. Introduction/1. Introduction.mp4 42MB
  3. 04 Shortest Path Algorithms/023 Dijkstra algorithm introduction - with adjacency matrix.mp4 36MB
  4. 4. Shortest Path Algorithms/5. Dijkstra algorithm introduction - with adjacency matrix.mp4 36MB
  5. 2. Breadth-First Search/4. BFS - WebCrawler implementation.vtt 33MB
  6. 2. Breadth-First Search/4. BFS - WebCrawler implementation.mp4 33MB
  7. 02 Breadth-First Search/007 BFS - WebCrawler implementation.mp4 33MB
  8. 05 Spanning Trees/037 Kruskal algorithm implementation II - disjoint set.mp4 31MB
  9. 5. Spanning Trees/5. Kruskal algorithm implementation II - disjoint set.mp4 31MB
  10. 04 Shortest Path Algorithms/027 Bellman-Ford algorithm implementation I.mp4 30MB
  11. 4. Shortest Path Algorithms/9. Bellman-Ford algorithm implementation I.mp4 30MB
  12. 03 Depth-First Search/017 Maze solving algorithm implementation.mp4 30MB
  13. 3. Depth-First Search/10. Maze solving algorithm implementation.mp4 30MB
  14. 08 Travelling Salesman Problem (TSP)/070 TSP implementation with simulated annealing II - tour.mp4 30MB
  15. 8. Travelling Salesman Problem (TSP)/3. TSP implementation with simulated annealing II - tour.mp4 30MB
  16. 09 Euler cycle - Chinese Postman Problem/075 Euler's cycles introduction.mp4 29MB
  17. 9. Euler cycle - Chinese Postman Problem/1. Euler's cycles introduction.mp4 29MB
  18. 08 Travelling Salesman Problem (TSP)/068 Travelling salesman problem introduction.mp4 25MB
  19. 8. Travelling Salesman Problem (TSP)/1. Travelling salesman problem introduction.mp4 25MB
  20. 02 Breadth-First Search/005 BFS implementation.mp4 24MB
  21. 2. Breadth-First Search/2. BFS implementation.mp4 24MB
  22. 05 Spanning Trees/040 Prims lazy algorithm implementation I.mp4 24MB
  23. 5. Spanning Trees/8. Prims lazy algorithm implementation I.mp4 24MB
  24. 07 Maximum Flow Problem/061 Maximum flow implementation I - Edge_ Vertex.mp4 24MB
  25. 7. Maximum Flow Problem/8. Maximum flow implementation I - Edge, Vertex.mp4 24MB
  26. 03 Depth-First Search/011 Topological ordering introduction.mp4 24MB
  27. 3. Depth-First Search/4. Topological ordering introduction.mp4 24MB
  28. 05 Spanning Trees/042 Spanning trees introduction - eager Prim's algorithm.mp4 24MB
  29. 5. Spanning Trees/10. Spanning trees introduction - eager Prim's algorithm.mp4 24MB
  30. 05 Spanning Trees/043 Eager Prim's algorithm implementation.mp4 23MB
  31. 5. Spanning Trees/11. Eager Prim's algorithm implementation.mp4 23MB
  32. 05 Spanning Trees/033 Union-find data structure (disjoint sets).mp4 23MB
  33. 5. Spanning Trees/1. Union-find data structure (disjoint sets).mp4 23MB
  34. 3. Depth-First Search/2. DFS implementation I - with stack.mp4 23MB
  35. 03 Depth-First Search/009 DFS implementation I - with stack.mp4 23MB
  36. 08 Travelling Salesman Problem (TSP)/071 TSP implementation with simulated annealing III - algorithm.mp4 23MB
  37. 8. Travelling Salesman Problem (TSP)/4. TSP implementation with simulated annealing III - algorithm.mp4 23MB
  38. 05 Spanning Trees/035 Spanning trees introduction - Kruskal algorithm.mp4 23MB
  39. 5. Spanning Trees/3. Spanning trees introduction - Kruskal algorithm.mp4 23MB
  40. 04 Shortest Path Algorithms/021 Dijkstra algorithm introduction - example.mp4 23MB
  41. 4. Shortest Path Algorithms/3. Dijkstra algorithm introduction - example.mp4 23MB
  42. 3. Depth-First Search/1. Depth-first search introduction.mp4 22MB
  43. 03 Depth-First Search/008 Depth-first search introduction.mp4 22MB
  44. 08 Travelling Salesman Problem (TSP)/069 TSP implementation with simulated annealing I - city.mp4 22MB
  45. 8. Travelling Salesman Problem (TSP)/2. TSP implementation with simulated annealing I - city.mp4 22MB
  46. 04 Shortest Path Algorithms/026 Dijkstra algorithm implementation II.mp4 22MB
  47. 4. Shortest Path Algorithms/8. Dijkstra algorithm implementation II.mp4 22MB
  48. 08 Travelling Salesman Problem (TSP)/073 Tabu search introduction.mp4 21MB
  49. 8. Travelling Salesman Problem (TSP)/6. Tabu search introduction.mp4 21MB
  50. 07 Maximum Flow Problem/055 Maximum flow introduction - properties.mp4 21MB
  51. 7. Maximum Flow Problem/2. Maximum flow introduction - properties.mp4 21MB
  52. 2. Breadth-First Search/1. Breadth-first search introduction.mp4 21MB
  53. 02 Breadth-First Search/004 Breadth-first search introduction.mp4 21MB
  54. 05 Spanning Trees/038 Kruskal algorithm implementation III.mp4 21MB
  55. 5. Spanning Trees/6. Kruskal algorithm implementation III.mp4 21MB
  56. 04 Shortest Path Algorithms/022 Bellman-Ford algorithm introduction.mp4 21MB
  57. 4. Shortest Path Algorithms/4. Bellman-Ford algorithm introduction.mp4 21MB
  58. 04 Shortest Path Algorithms/029 DAG shortest path implementation.mp4 20MB
  59. 4. Shortest Path Algorithms/11. DAG shortest path implementation.mp4 20MB
  60. 04 Shortest Path Algorithms/024 Shortest path algorithms applications.mp4 20MB
  61. 4. Shortest Path Algorithms/6. Shortest path algorithms applications.mp4 20MB
  62. 04 Shortest Path Algorithms/025 Dijkstra algorithm implementation I.mp4 20MB
  63. 4. Shortest Path Algorithms/7. Dijkstra algorithm implementation I.mp4 20MB
  64. 07 Maximum Flow Problem/059 Maximum flow introduction - example.mp4 19MB
  65. 7. Maximum Flow Problem/6. Maximum flow introduction - example.mp4 19MB
  66. 01 Introduction/002 Graph theory introduction.mp4 19MB
  67. 02 Breadth-First Search/006 BFS - WebCrawler (core of search engines).mp4 18MB
  68. 2. Breadth-First Search/3. BFS - WebCrawler (core of search engines).mp4 18MB
  69. 06 Strongly Connected Components/047 Kosaraju implementation I - the Graph class.mp4 18MB
  70. 6. Strongly Connected Components/3. Kosaraju implementation I - the Graph class.mp4 18MB
  71. 06 Strongly Connected Components/046 Kosaraju algorithm introduction.mp4 17MB
  72. 6. Strongly Connected Components/2. Kosaraju algorithm introduction.mp4 17MB
  73. 06 Strongly Connected Components/045 Strongly connected components introduction.mp4 17MB
  74. 6. Strongly Connected Components/1. Strongly connected components introduction.mp4 17MB
  75. 05 Spanning Trees/044 Applications of spanning trees.mp4 17MB
  76. 5. Spanning Trees/12. Applications of spanning trees.mp4 17MB
  77. 07 Maximum Flow Problem/063 Maximum flow implementation III - Ford-Fulkerson algorithm.mp4 17MB
  78. 7. Maximum Flow Problem/10. Maximum flow implementation III - Ford-Fulkerson algorithm.mp4 17MB
  79. 03 Depth-First Search/016 Cycle detection implementation II.mp4 17MB
  80. 3. Depth-First Search/9. Cycle detection implementation II.mp4 17MB
  81. 05 Spanning Trees/039 Spanning trees introduction - lazy Prim's algorithm.mp4 16MB
  82. 5. Spanning Trees/7. Spanning trees introduction - lazy Prim's algorithm.mp4 16MB
  83. 05 Spanning Trees/036 Kruskal algorithm implementation I.mp4 16MB
  84. 5. Spanning Trees/4. Kruskal algorithm implementation I.mp4 16MB
  85. 03 Depth-First Search/015 Cycle detection implementation I.mp4 16MB
  86. 3. Depth-First Search/8. Cycle detection implementation I.mp4 16MB
  87. 06 Strongly Connected Components/053 Applications of strongly connected components.mp4 16MB
  88. 6. Strongly Connected Components/9. Applications of strongly connected components.mp4 16MB
  89. 04 Shortest Path Algorithms/031 Arbitrage situations on FOREX implementation.mp4 16MB
  90. 4. Shortest Path Algorithms/13. Arbitrage situations on FOREX implementation.mp4 16MB
  91. 7. Maximum Flow Problem/4. Maximum flow introduction - residual networks.mp4 15MB
  92. 07 Maximum Flow Problem/057 Maximum flow introduction - residual networks.mp4 15MB
  93. 07 Maximum Flow Problem/054 Maximum flow introduction - basics.mp4 15MB
  94. 7. Maximum Flow Problem/1. Maximum flow introduction - basics.mp4 15MB
  95. 07 Maximum Flow Problem/064 Maximum flow implementation IV - augmentation.mp4 15MB
  96. 7. Maximum Flow Problem/11. Maximum flow implementation IV - augmentation.mp4 15MB
  97. 06 Strongly Connected Components/048 Kosaraju implementation II.mp4 15MB
  98. 6. Strongly Connected Components/4. Kosaraju implementation II.mp4 15MB
  99. 05 Spanning Trees/041 Prims lazy algorithm implementation II - the core.mp4 14MB
  100. 5. Spanning Trees/9. Prims lazy algorithm implementation II - the core.mp4 14MB
  101. 06 Strongly Connected Components/051 Tarjan implementation I.mp4 14MB
  102. 6. Strongly Connected Components/7. Tarjan implementation I.mp4 14MB
  103. 03 Depth-First Search/014 Cycle detection introduction.mp4 14MB
  104. 3. Depth-First Search/7. Cycle detection introduction.mp4 14MB
  105. 05 Spanning Trees/034 Union-find data structure illustration.mp4 13MB
  106. 5. Spanning Trees/2. Union-find data structure illustration.mp4 13MB
  107. 03 Depth-First Search/013 Topological ordering implementation II.mp4 13MB
  108. 3. Depth-First Search/6. Topological ordering implementation II.mp4 13MB
  109. 06 Strongly Connected Components/050 Tarjan algorithm introduction.mp4 13MB
  110. 6. Strongly Connected Components/6. Tarjan algorithm introduction.mp4 13MB
  111. 04 Shortest Path Algorithms/020 Dijkstra algorithm introduction - algorithm.mp4 13MB
  112. 4. Shortest Path Algorithms/2. Dijkstra algorithm introduction - algorithm.mp4 13MB
  113. 04 Shortest Path Algorithms/019 Dijkstra algorithm introduction - basics.mp4 12MB
  114. 4. Shortest Path Algorithms/1. Dijkstra algorithm introduction - basics.mp4 12MB
  115. 07 Maximum Flow Problem/056 Maximum flow introduction - cuts.mp4 12MB
  116. 7. Maximum Flow Problem/3. Maximum flow introduction - cuts.mp4 12MB
  117. 04 Shortest Path Algorithms/028 Bellman-Ford algorithm implementation II.mp4 12MB
  118. 4. Shortest Path Algorithms/10. Bellman-Ford algorithm implementation II.mp4 12MB
  119. 03 Depth-First Search/018 Memory management_ BFS vs DFS.mp4 12MB
  120. 3. Depth-First Search/11. Memory management BFS vs DFS.mp4 12MB
  121. 03 Depth-First Search/012 Topological ordering implementation I.mp4 11MB
  122. 3. Depth-First Search/5. Topological ordering implementation I.mp4 11MB
  123. 10. Course Materials (DOWNLOADS)/1.1 AdvancedAlgorithmsJava.zip.zip 11MB
  124. 10 Source Code & Slides/077 AdvancedAlgosSlides.zip 11MB
  125. 07 Maximum Flow Problem/062 Maximum flow implementation II - FlowNetwork class.mp4 11MB
  126. 7. Maximum Flow Problem/9. Maximum flow implementation II - FlowNetwork class.mp4 11MB
  127. 07 Maximum Flow Problem/058 Maximum flow introduction - Ford-Fulkerson algorithm.mp4 11MB
  128. 7. Maximum Flow Problem/5. Maximum flow introduction - Ford-Fulkerson algorithm.mp4 11MB
  129. 08 Travelling Salesman Problem (TSP)/074 Tabu search introduction II.mp4 10MB
  130. 8. Travelling Salesman Problem (TSP)/7. Tabu search introduction II.mp4 10MB
  131. 08 Travelling Salesman Problem (TSP)/072 TSP implementation with simulated annealing IV - testing.mp4 9MB
  132. 8. Travelling Salesman Problem (TSP)/5. TSP implementation with simulated annealing IV - testing.mp4 9MB
  133. 4. Shortest Path Algorithms/14. Longest path implementation.mp4 9MB
  134. 04 Shortest Path Algorithms/032 Longest path implementation.mp4 9MB
  135. 07 Maximum Flow Problem/066 Bipartite matching problem introduction.mp4 8MB
  136. 7. Maximum Flow Problem/13. Bipartite matching problem introduction.mp4 8MB
  137. 3. Depth-First Search/3. DFS implementation II - with recursion.mp4 8MB
  138. 03 Depth-First Search/010 DFS implementation II - with recursion.mp4 8MB
  139. 04 Shortest Path Algorithms/030 Arbitrage situations on FOREX introduction.mp4 8MB
  140. 4. Shortest Path Algorithms/12. Arbitrage situations on FOREX introduction.mp4 8MB
  141. 01 Introduction/001 Introduction.mp4 7MB
  142. 7. Maximum Flow Problem/7. Maximum flow introduction - applications.mp4 7MB
  143. 07 Maximum Flow Problem/060 Maximum flow introduction - applications.mp4 7MB
  144. 06 Strongly Connected Components/049 Kosaraju algorithm implementation III - test.mp4 7MB
  145. 6. Strongly Connected Components/5. Kosaraju algorithm implementation III - test.mp4 7MB
  146. 7. Maximum Flow Problem/12. Maximum flow implementation V - testing.mp4 7MB
  147. 07 Maximum Flow Problem/065 Maximum flow implementation V - testing.mp4 7MB
  148. 6. Strongly Connected Components/8. Tarjan implementation II - test.mp4 6MB
  149. 06 Strongly Connected Components/052 Tarjan implementation II - test.mp4 6MB
  150. 7. Maximum Flow Problem/14. Bipartite matching implementation.mp4 6MB
  151. 07 Maximum Flow Problem/067 Bipartite matching implementation.mp4 6MB
  152. 3. Depth-First Search/3. DFS implementation II - with recursion.vtt 6MB
  153. 10 Source Code & Slides/076 GraphalgorithmsCode.zip 99KB
  154. 03 Depth-First Search/017 Maze solving algorithm implementation-subtitle-en.srt 21KB
  155. 05 Spanning Trees/037 Kruskal algorithm implementation II - disjoint set-subtitle-en.srt 19KB
  156. 3. Depth-First Search/10. Maze solving algorithm implementation.vtt 19KB
  157. 02 Breadth-First Search/007 BFS - WebCrawler implementation-subtitle-en.srt 17KB
  158. 5. Spanning Trees/5. Kruskal algorithm implementation II - disjoint set.vtt 17KB
  159. 04 Shortest Path Algorithms/027 Bellman-Ford algorithm implementation I-subtitle-en.srt 16KB
  160. 08 Travelling Salesman Problem (TSP)/070 TSP implementation with simulated annealing II - tour-subtitle-en.srt 16KB
  161. 02 Breadth-First Search/005 BFS implementation-subtitle-en.srt 15KB
  162. 05 Spanning Trees/043 Eager Prim's algorithm implementation-subtitle-en.srt 15KB
  163. 05 Spanning Trees/033 Union-find data structure (disjoint sets)-subtitle-en.srt 15KB
  164. 03 Depth-First Search/008 Depth-first search introduction-subtitle-en.srt 15KB
  165. 05 Spanning Trees/042 Spanning trees introduction - eager Prim's algorithm-subtitle-en.srt 15KB
  166. 08 Travelling Salesman Problem (TSP)/068 Travelling salesman problem introduction-subtitle-en.srt 15KB
  167. 4. Shortest Path Algorithms/9. Bellman-Ford algorithm implementation I.vtt 15KB
  168. 05 Spanning Trees/035 Spanning trees introduction - Kruskal algorithm-subtitle-en.srt 15KB
  169. 03 Depth-First Search/011 Topological ordering introduction-subtitle-en.srt 14KB
  170. 8. Travelling Salesman Problem (TSP)/3. TSP implementation with simulated annealing II - tour.vtt 14KB
  171. 07 Maximum Flow Problem/061 Maximum flow implementation I - Edge_ Vertex-subtitle-en.srt 14KB
  172. 04 Shortest Path Algorithms/021 Dijkstra algorithm introduction - example-subtitle-en.srt 14KB
  173. 04 Shortest Path Algorithms/026 Dijkstra algorithm implementation II-subtitle-en.srt 14KB
  174. 2. Breadth-First Search/2. BFS implementation.vtt 13KB
  175. 5. Spanning Trees/11. Eager Prim's algorithm implementation.vtt 13KB
  176. 04 Shortest Path Algorithms/029 DAG shortest path implementation-subtitle-en.srt 13KB
  177. 5. Spanning Trees/1. Union-find data structure (disjoint sets).vtt 13KB
  178. 3. Depth-First Search/1. Depth-first search introduction.vtt 13KB
  179. 5. Spanning Trees/10. Spanning trees introduction - eager Prim's algorithm.vtt 13KB
  180. 8. Travelling Salesman Problem (TSP)/1. Travelling salesman problem introduction.vtt 13KB
  181. 5. Spanning Trees/3. Spanning trees introduction - Kruskal algorithm.vtt 13KB
  182. 02 Breadth-First Search/004 Breadth-first search introduction-subtitle-en.srt 13KB
  183. 09 Euler cycle - Chinese Postman Problem/075 Euler's cycles introduction-subtitle-en.srt 13KB
  184. 3. Depth-First Search/4. Topological ordering introduction.vtt 13KB
  185. 03 Depth-First Search/009 DFS implementation I - with stack-subtitle-en.srt 13KB
  186. 04 Shortest Path Algorithms/023 Dijkstra algorithm introduction - with adjacency matrix-subtitle-en.srt 12KB
  187. 05 Spanning Trees/038 Kruskal algorithm implementation III-subtitle-en.srt 12KB
  188. 05 Spanning Trees/040 Prims lazy algorithm implementation I-subtitle-en.srt 12KB
  189. 04 Shortest Path Algorithms/025 Dijkstra algorithm implementation I-subtitle-en.srt 12KB
  190. 7. Maximum Flow Problem/8. Maximum flow implementation I - Edge, Vertex.vtt 12KB
  191. 08 Travelling Salesman Problem (TSP)/071 TSP implementation with simulated annealing III - algorithm-subtitle-en.srt 12KB
  192. 4. Shortest Path Algorithms/3. Dijkstra algorithm introduction - example.vtt 12KB
  193. 4. Shortest Path Algorithms/8. Dijkstra algorithm implementation II.vtt 12KB
  194. 4. Shortest Path Algorithms/11. DAG shortest path implementation.vtt 12KB
  195. 08 Travelling Salesman Problem (TSP)/069 TSP implementation with simulated annealing I - city-subtitle-en.srt 12KB
  196. 06 Strongly Connected Components/046 Kosaraju algorithm introduction-subtitle-en.srt 12KB
  197. 04 Shortest Path Algorithms/022 Bellman-Ford algorithm introduction-subtitle-en.srt 12KB
  198. 07 Maximum Flow Problem/055 Maximum flow introduction - properties-subtitle-en.srt 12KB
  199. 08 Travelling Salesman Problem (TSP)/073 Tabu search introduction-subtitle-en.srt 12KB
  200. 9. Euler cycle - Chinese Postman Problem/1. Euler's cycles introduction.vtt 12KB
  201. 2. Breadth-First Search/1. Breadth-first search introduction.vtt 12KB
  202. 07 Maximum Flow Problem/059 Maximum flow introduction - example-subtitle-en.srt 11KB
  203. 04 Shortest Path Algorithms/024 Shortest path algorithms applications-subtitle-en.srt 11KB
  204. 3. Depth-First Search/2. DFS implementation I - with stack.vtt 11KB
  205. 4. Shortest Path Algorithms/5. Dijkstra algorithm introduction - with adjacency matrix.vtt 11KB
  206. 5. Spanning Trees/6. Kruskal algorithm implementation III.vtt 11KB
  207. 4. Shortest Path Algorithms/7. Dijkstra algorithm implementation I.vtt 11KB
  208. 5. Spanning Trees/8. Prims lazy algorithm implementation I.vtt 11KB
  209. 8. Travelling Salesman Problem (TSP)/4. TSP implementation with simulated annealing III - algorithm.vtt 11KB
  210. 05 Spanning Trees/036 Kruskal algorithm implementation I-subtitle-en.srt 11KB
  211. 8. Travelling Salesman Problem (TSP)/2. TSP implementation with simulated annealing I - city.vtt 11KB
  212. 4. Shortest Path Algorithms/4. Bellman-Ford algorithm introduction.vtt 11KB
  213. 6. Strongly Connected Components/2. Kosaraju algorithm introduction.vtt 11KB
  214. 7. Maximum Flow Problem/2. Maximum flow introduction - properties.vtt 11KB
  215. 8. Travelling Salesman Problem (TSP)/6. Tabu search introduction.vtt 10KB
  216. 05 Spanning Trees/044 Applications of spanning trees-subtitle-en.srt 10KB
  217. 4. Shortest Path Algorithms/6. Shortest path algorithms applications.vtt 10KB
  218. 01 Introduction/002 Graph theory introduction-subtitle-en.srt 10KB
  219. 7. Maximum Flow Problem/6. Maximum flow introduction - example.vtt 10KB
  220. 06 Strongly Connected Components/053 Applications of strongly connected components-subtitle-en.srt 10KB
  221. 07 Maximum Flow Problem/063 Maximum flow implementation III - Ford-Fulkerson algorithm-subtitle-en.srt 10KB
  222. 03 Depth-First Search/015 Cycle detection implementation I-subtitle-en.srt 10KB
  223. 5. Spanning Trees/4. Kruskal algorithm implementation I.vtt 10KB
  224. 05 Spanning Trees/039 Spanning trees introduction - lazy Prim's algorithm-subtitle-en.srt 10KB
  225. 03 Depth-First Search/016 Cycle detection implementation II-subtitle-en.srt 9KB
  226. 5. Spanning Trees/12. Applications of spanning trees.vtt 9KB
  227. 03 Depth-First Search/014 Cycle detection introduction-subtitle-en.srt 9KB
  228. 05 Spanning Trees/034 Union-find data structure illustration-subtitle-en.srt 9KB
  229. 04 Shortest Path Algorithms/031 Arbitrage situations on FOREX implementation-subtitle-en.srt 9KB
  230. 07 Maximum Flow Problem/054 Maximum flow introduction - basics-subtitle-en.srt 9KB
  231. 1. Introduction/2. Graph theory introduction.vtt 9KB
  232. 6. Strongly Connected Components/9. Applications of strongly connected components.vtt 9KB
  233. 7. Maximum Flow Problem/10. Maximum flow implementation III - Ford-Fulkerson algorithm.vtt 9KB
  234. 3. Depth-First Search/8. Cycle detection implementation I.vtt 9KB
  235. 06 Strongly Connected Components/047 Kosaraju implementation I - the Graph class-subtitle-en.srt 9KB
  236. 07 Maximum Flow Problem/057 Maximum flow introduction - residual networks-subtitle-en.srt 9KB
  237. 5. Spanning Trees/7. Spanning trees introduction - lazy Prim's algorithm.vtt 9KB
  238. 05 Spanning Trees/041 Prims lazy algorithm implementation II - the core-subtitle-en.srt 8KB
  239. 3. Depth-First Search/9. Cycle detection implementation II.vtt 8KB
  240. 5. Spanning Trees/2. Union-find data structure illustration.vtt 8KB
  241. 06 Strongly Connected Components/045 Strongly connected components introduction-subtitle-en.srt 8KB
  242. 3. Depth-First Search/7. Cycle detection introduction.vtt 8KB
  243. 4. Shortest Path Algorithms/13. Arbitrage situations on FOREX implementation.vtt 8KB
  244. 04 Shortest Path Algorithms/020 Dijkstra algorithm introduction - algorithm-subtitle-en.srt 8KB
  245. 07 Maximum Flow Problem/064 Maximum flow implementation IV - augmentation-subtitle-en.srt 8KB
  246. 7. Maximum Flow Problem/1. Maximum flow introduction - basics.vtt 8KB
  247. 04 Shortest Path Algorithms/019 Dijkstra algorithm introduction - basics-subtitle-en.srt 8KB
  248. 7. Maximum Flow Problem/4. Maximum flow introduction - residual networks.vtt 8KB
  249. 6. Strongly Connected Components/1. Strongly connected components introduction.vtt 8KB
  250. 06 Strongly Connected Components/050 Tarjan algorithm introduction-subtitle-en.srt 8KB
  251. 04 Shortest Path Algorithms/028 Bellman-Ford algorithm implementation II-subtitle-en.srt 8KB
  252. 5. Spanning Trees/9. Prims lazy algorithm implementation II - the core.vtt 8KB
  253. 6. Strongly Connected Components/3. Kosaraju implementation I - the Graph class.vtt 8KB
  254. 02 Breadth-First Search/006 BFS - WebCrawler (core of search engines)-subtitle-en.srt 7KB
  255. 06 Strongly Connected Components/048 Kosaraju implementation II-subtitle-en.srt 7KB
  256. 03 Depth-First Search/012 Topological ordering implementation I-subtitle-en.srt 7KB
  257. 7. Maximum Flow Problem/11. Maximum flow implementation IV - augmentation.vtt 7KB
  258. 4. Shortest Path Algorithms/2. Dijkstra algorithm introduction - algorithm.vtt 7KB
  259. 4. Shortest Path Algorithms/1. Dijkstra algorithm introduction - basics.vtt 7KB
  260. 03 Depth-First Search/013 Topological ordering implementation II-subtitle-en.srt 7KB
  261. 4. Shortest Path Algorithms/10. Bellman-Ford algorithm implementation II.vtt 7KB
  262. 6. Strongly Connected Components/6. Tarjan algorithm introduction.vtt 7KB
  263. 2. Breadth-First Search/3. BFS - WebCrawler (core of search engines).vtt 7KB
  264. 03 Depth-First Search/018 Memory management_ BFS vs DFS-subtitle-en.srt 7KB
  265. 6. Strongly Connected Components/4. Kosaraju implementation II.vtt 7KB
  266. 3. Depth-First Search/5. Topological ordering implementation I.vtt 7KB
  267. 07 Maximum Flow Problem/056 Maximum flow introduction - cuts-subtitle-en.srt 6KB
  268. 06 Strongly Connected Components/051 Tarjan implementation I-subtitle-en.srt 6KB
  269. 3. Depth-First Search/6. Topological ordering implementation II.vtt 6KB
  270. 08 Travelling Salesman Problem (TSP)/072 TSP implementation with simulated annealing IV - testing-subtitle-en.srt 6KB
  271. 3. Depth-First Search/11. Memory management BFS vs DFS.vtt 6KB
  272. 07 Maximum Flow Problem/058 Maximum flow introduction - Ford-Fulkerson algorithm-subtitle-en.srt 6KB
  273. 08 Travelling Salesman Problem (TSP)/074 Tabu search introduction II-subtitle-en.srt 6KB
  274. 07 Maximum Flow Problem/062 Maximum flow implementation II - FlowNetwork class-subtitle-en.srt 6KB
  275. 7. Maximum Flow Problem/3. Maximum flow introduction - cuts.vtt 6KB
  276. 6. Strongly Connected Components/7. Tarjan implementation I.vtt 6KB
  277. 7. Maximum Flow Problem/5. Maximum flow introduction - Ford-Fulkerson algorithm.vtt 5KB
  278. 8. Travelling Salesman Problem (TSP)/5. TSP implementation with simulated annealing IV - testing.vtt 5KB
  279. 04 Shortest Path Algorithms/030 Arbitrage situations on FOREX introduction-subtitle-en.srt 5KB
  280. 04 Shortest Path Algorithms/032 Longest path implementation-subtitle-en.srt 5KB
  281. 7. Maximum Flow Problem/9. Maximum flow implementation II - FlowNetwork class.vtt 5KB
  282. 8. Travelling Salesman Problem (TSP)/7. Tabu search introduction II.vtt 5KB
  283. 03 Depth-First Search/010 DFS implementation II - with recursion-subtitle-en.srt 5KB
  284. 07 Maximum Flow Problem/066 Bipartite matching problem introduction-subtitle-en.srt 5KB
  285. 11. DISCOUNT FOR OTHER COURSES!/1. 90% OFF For Other Courses.html 5KB
  286. 01 Introduction/001 Introduction-subtitle-en.srt 5KB
  287. 4. Shortest Path Algorithms/12. Arbitrage situations on FOREX introduction.vtt 5KB
  288. 4. Shortest Path Algorithms/14. Longest path implementation.vtt 5KB
  289. 1. Introduction/1. Introduction.vtt 5KB
  290. 7. Maximum Flow Problem/13. Bipartite matching problem introduction.vtt 5KB
  291. 07 Maximum Flow Problem/060 Maximum flow introduction - applications-subtitle-en.srt 4KB
  292. 07 Maximum Flow Problem/065 Maximum flow implementation V - testing-subtitle-en.srt 4KB
  293. 7. Maximum Flow Problem/7. Maximum flow introduction - applications.vtt 4KB
  294. 10 Source Code & Slides/078 FINAL-COUPONS.txt 4KB
  295. 7. Maximum Flow Problem/12. Maximum flow implementation V - testing.vtt 3KB
  296. 06 Strongly Connected Components/049 Kosaraju algorithm implementation III - test-subtitle-en.srt 3KB
  297. 08 Travelling Salesman Problem (TSP)/069 TSP.zip 3KB
  298. 8. Travelling Salesman Problem (TSP)/2.1 TSP.zip 3KB
  299. 06 Strongly Connected Components/052 Tarjan implementation II - test-subtitle-en.srt 3KB
  300. 07 Maximum Flow Problem/067 Bipartite matching implementation-subtitle-en.srt 3KB
  301. 6. Strongly Connected Components/5. Kosaraju algorithm implementation III - test.vtt 3KB
  302. 6. Strongly Connected Components/8. Tarjan implementation II - test.vtt 3KB
  303. 7. Maximum Flow Problem/14. Bipartite matching implementation.vtt 3KB
  304. 10 Source Code & Slides/078 DISCOUNT FOR OTHER COURSES!.html 1KB
  305. 01 Introduction/003 Complexity theory.html 1KB
  306. 10 Source Code & Slides/076 Source code.html 1KB
  307. 10 Source Code & Slides/077 Slides.html 1KB
  308. 01 Introduction/003 free-complexity-theory.zip 264B
  309. courseupload.com.webloc 248B
  310. 3. Depth-First Search/12. Graph traversal quiz.html 130B
  311. 4. Shortest Path Algorithms/15. Shortest path algorithms quiz.html 130B
  312. 5. Spanning Trees/13. Spanning trees quiz.html 130B
  313. 6. Strongly Connected Components/10. Strongly connected components quiz.html 130B
  314. 8. Travelling Salesman Problem (TSP)/8. Travelling salesman problem quiz.html 130B
  315. 10. Course Materials (DOWNLOADS)/1. Course materials.html 60B