589689.xyz

[] Udemy - advanced-algorithms-in-java

  • 收录时间:2018-03-09 04:35:40
  • 文件大小:1GB
  • 下载次数:231
  • 最近下载:2021-01-15 20:06:15
  • 磁力链接:
立即下载 复制链接

文件列表

  1. 04 Shortest Path Algorithms/023 Dijkstra algorithm introduction - with adjacency matrix.mp4 36MB
  2. 02 Breadth-First Search/007 BFS - WebCrawler implementation.mp4 33MB
  3. 05 Spanning Trees/037 Kruskal algorithm implementation II - disjoint set.mp4 31MB
  4. 04 Shortest Path Algorithms/027 Bellman-Ford algorithm implementation I.mp4 30MB
  5. 03 Depth-First Search/017 Maze solving algorithm implementation.mp4 30MB
  6. 08 Travelling Salesman Problem (TSP)/070 TSP implementation with simulated annealing II - tour.mp4 30MB
  7. 09 Euler cycle - Chinese Postman Problem/075 Euler's cycles introduction.mp4 29MB
  8. 08 Travelling Salesman Problem (TSP)/068 Travelling salesman problem introduction.mp4 25MB
  9. 02 Breadth-First Search/005 BFS implementation.mp4 24MB
  10. 05 Spanning Trees/040 Prims lazy algorithm implementation I.mp4 24MB
  11. 07 Maximum Flow Problem/061 Maximum flow implementation I - Edge_ Vertex.mp4 24MB
  12. 03 Depth-First Search/011 Topological ordering introduction.mp4 24MB
  13. 05 Spanning Trees/042 Spanning trees introduction - eager Prim's algorithm.mp4 24MB
  14. 05 Spanning Trees/043 Eager Prim's algorithm implementation.mp4 23MB
  15. 05 Spanning Trees/033 Union-find data structure (disjoint sets).mp4 23MB
  16. 03 Depth-First Search/009 DFS implementation I - with stack.mp4 23MB
  17. 08 Travelling Salesman Problem (TSP)/071 TSP implementation with simulated annealing III - algorithm.mp4 23MB
  18. 05 Spanning Trees/035 Spanning trees introduction - Kruskal algorithm.mp4 23MB
  19. 04 Shortest Path Algorithms/021 Dijkstra algorithm introduction - example.mp4 23MB
  20. 03 Depth-First Search/008 Depth-first search introduction.mp4 22MB
  21. 08 Travelling Salesman Problem (TSP)/069 TSP implementation with simulated annealing I - city.mp4 22MB
  22. 04 Shortest Path Algorithms/026 Dijkstra algorithm implementation II.mp4 22MB
  23. 08 Travelling Salesman Problem (TSP)/073 Tabu search introduction.mp4 21MB
  24. 07 Maximum Flow Problem/055 Maximum flow introduction - properties.mp4 21MB
  25. 02 Breadth-First Search/004 Breadth-first search introduction.mp4 21MB
  26. 05 Spanning Trees/038 Kruskal algorithm implementation III.mp4 21MB
  27. 04 Shortest Path Algorithms/022 Bellman-Ford algorithm introduction.mp4 21MB
  28. 04 Shortest Path Algorithms/029 DAG shortest path implementation.mp4 20MB
  29. 04 Shortest Path Algorithms/024 Shortest path algorithms applications.mp4 20MB
  30. 04 Shortest Path Algorithms/025 Dijkstra algorithm implementation I.mp4 20MB
  31. 07 Maximum Flow Problem/059 Maximum flow introduction - example.mp4 19MB
  32. 01 Introduction/002 Graph theory introduction.mp4 19MB
  33. 02 Breadth-First Search/006 BFS - WebCrawler (core of search engines).mp4 18MB
  34. 06 Strongly Connected Components/047 Kosaraju implementation I - the Graph class.mp4 18MB
  35. 06 Strongly Connected Components/046 Kosaraju algorithm introduction.mp4 17MB
  36. 06 Strongly Connected Components/045 Strongly connected components introduction.mp4 17MB
  37. 05 Spanning Trees/044 Applications of spanning trees.mp4 17MB
  38. 07 Maximum Flow Problem/063 Maximum flow implementation III - Ford-Fulkerson algorithm.mp4 17MB
  39. 03 Depth-First Search/016 Cycle detection implementation II.mp4 17MB
  40. 05 Spanning Trees/039 Spanning trees introduction - lazy Prim's algorithm.mp4 16MB
  41. 05 Spanning Trees/036 Kruskal algorithm implementation I.mp4 16MB
  42. 03 Depth-First Search/015 Cycle detection implementation I.mp4 16MB
  43. 06 Strongly Connected Components/053 Applications of strongly connected components.mp4 16MB
  44. 04 Shortest Path Algorithms/031 Arbitrage situations on FOREX implementation.mp4 16MB
  45. 07 Maximum Flow Problem/057 Maximum flow introduction - residual networks.mp4 15MB
  46. 07 Maximum Flow Problem/054 Maximum flow introduction - basics.mp4 15MB
  47. 07 Maximum Flow Problem/064 Maximum flow implementation IV - augmentation.mp4 15MB
  48. 06 Strongly Connected Components/048 Kosaraju implementation II.mp4 15MB
  49. 05 Spanning Trees/041 Prims lazy algorithm implementation II - the core.mp4 14MB
  50. 06 Strongly Connected Components/051 Tarjan implementation I.mp4 14MB
  51. 03 Depth-First Search/014 Cycle detection introduction.mp4 14MB
  52. 05 Spanning Trees/034 Union-find data structure illustration.mp4 13MB
  53. 03 Depth-First Search/013 Topological ordering implementation II.mp4 13MB
  54. 06 Strongly Connected Components/050 Tarjan algorithm introduction.mp4 13MB
  55. 04 Shortest Path Algorithms/020 Dijkstra algorithm introduction - algorithm.mp4 13MB
  56. 04 Shortest Path Algorithms/019 Dijkstra algorithm introduction - basics.mp4 12MB
  57. 07 Maximum Flow Problem/056 Maximum flow introduction - cuts.mp4 12MB
  58. 04 Shortest Path Algorithms/028 Bellman-Ford algorithm implementation II.mp4 12MB
  59. 03 Depth-First Search/018 Memory management_ BFS vs DFS.mp4 12MB
  60. 03 Depth-First Search/012 Topological ordering implementation I.mp4 11MB
  61. 10 Source Code & Slides/077 AdvancedAlgosSlides.zip 11MB
  62. 07 Maximum Flow Problem/062 Maximum flow implementation II - FlowNetwork class.mp4 11MB
  63. 07 Maximum Flow Problem/058 Maximum flow introduction - Ford-Fulkerson algorithm.mp4 11MB
  64. 08 Travelling Salesman Problem (TSP)/074 Tabu search introduction II.mp4 10MB
  65. 08 Travelling Salesman Problem (TSP)/072 TSP implementation with simulated annealing IV - testing.mp4 9MB
  66. 04 Shortest Path Algorithms/032 Longest path implementation.mp4 9MB
  67. 07 Maximum Flow Problem/066 Bipartite matching problem introduction.mp4 8MB
  68. 03 Depth-First Search/010 DFS implementation II - with recursion.mp4 8MB
  69. 04 Shortest Path Algorithms/030 Arbitrage situations on FOREX introduction.mp4 8MB
  70. 01 Introduction/001 Introduction.mp4 7MB
  71. 07 Maximum Flow Problem/060 Maximum flow introduction - applications.mp4 7MB
  72. 06 Strongly Connected Components/049 Kosaraju algorithm implementation III - test.mp4 7MB
  73. 07 Maximum Flow Problem/065 Maximum flow implementation V - testing.mp4 7MB
  74. 06 Strongly Connected Components/052 Tarjan implementation II - test.mp4 6MB
  75. 07 Maximum Flow Problem/067 Bipartite matching implementation.mp4 6MB
  76. 10 Source Code & Slides/076 GraphalgorithmsCode.zip 99KB
  77. 03 Depth-First Search/017 Maze solving algorithm implementation-subtitle-en.srt 21KB
  78. 05 Spanning Trees/037 Kruskal algorithm implementation II - disjoint set-subtitle-en.srt 19KB
  79. 02 Breadth-First Search/007 BFS - WebCrawler implementation-subtitle-en.srt 17KB
  80. 04 Shortest Path Algorithms/027 Bellman-Ford algorithm implementation I-subtitle-en.srt 16KB
  81. 08 Travelling Salesman Problem (TSP)/070 TSP implementation with simulated annealing II - tour-subtitle-en.srt 16KB
  82. 02 Breadth-First Search/005 BFS implementation-subtitle-en.srt 15KB
  83. 05 Spanning Trees/043 Eager Prim's algorithm implementation-subtitle-en.srt 15KB
  84. 05 Spanning Trees/033 Union-find data structure (disjoint sets)-subtitle-en.srt 15KB
  85. 03 Depth-First Search/008 Depth-first search introduction-subtitle-en.srt 15KB
  86. 05 Spanning Trees/042 Spanning trees introduction - eager Prim's algorithm-subtitle-en.srt 15KB
  87. 08 Travelling Salesman Problem (TSP)/068 Travelling salesman problem introduction-subtitle-en.srt 15KB
  88. 05 Spanning Trees/035 Spanning trees introduction - Kruskal algorithm-subtitle-en.srt 15KB
  89. 03 Depth-First Search/011 Topological ordering introduction-subtitle-en.srt 14KB
  90. 07 Maximum Flow Problem/061 Maximum flow implementation I - Edge_ Vertex-subtitle-en.srt 14KB
  91. 04 Shortest Path Algorithms/021 Dijkstra algorithm introduction - example-subtitle-en.srt 14KB
  92. 04 Shortest Path Algorithms/026 Dijkstra algorithm implementation II-subtitle-en.srt 14KB
  93. 04 Shortest Path Algorithms/029 DAG shortest path implementation-subtitle-en.srt 13KB
  94. 02 Breadth-First Search/004 Breadth-first search introduction-subtitle-en.srt 13KB
  95. 09 Euler cycle - Chinese Postman Problem/075 Euler's cycles introduction-subtitle-en.srt 13KB
  96. 03 Depth-First Search/009 DFS implementation I - with stack-subtitle-en.srt 13KB
  97. 04 Shortest Path Algorithms/023 Dijkstra algorithm introduction - with adjacency matrix-subtitle-en.srt 12KB
  98. 05 Spanning Trees/038 Kruskal algorithm implementation III-subtitle-en.srt 12KB
  99. 05 Spanning Trees/040 Prims lazy algorithm implementation I-subtitle-en.srt 12KB
  100. 04 Shortest Path Algorithms/025 Dijkstra algorithm implementation I-subtitle-en.srt 12KB
  101. 08 Travelling Salesman Problem (TSP)/071 TSP implementation with simulated annealing III - algorithm-subtitle-en.srt 12KB
  102. 08 Travelling Salesman Problem (TSP)/069 TSP implementation with simulated annealing I - city-subtitle-en.srt 12KB
  103. 06 Strongly Connected Components/046 Kosaraju algorithm introduction-subtitle-en.srt 12KB
  104. 04 Shortest Path Algorithms/022 Bellman-Ford algorithm introduction-subtitle-en.srt 12KB
  105. 07 Maximum Flow Problem/055 Maximum flow introduction - properties-subtitle-en.srt 12KB
  106. 08 Travelling Salesman Problem (TSP)/073 Tabu search introduction-subtitle-en.srt 12KB
  107. 07 Maximum Flow Problem/059 Maximum flow introduction - example-subtitle-en.srt 11KB
  108. 04 Shortest Path Algorithms/024 Shortest path algorithms applications-subtitle-en.srt 11KB
  109. 05 Spanning Trees/036 Kruskal algorithm implementation I-subtitle-en.srt 11KB
  110. 05 Spanning Trees/044 Applications of spanning trees-subtitle-en.srt 10KB
  111. 01 Introduction/002 Graph theory introduction-subtitle-en.srt 10KB
  112. 06 Strongly Connected Components/053 Applications of strongly connected components-subtitle-en.srt 10KB
  113. 07 Maximum Flow Problem/063 Maximum flow implementation III - Ford-Fulkerson algorithm-subtitle-en.srt 10KB
  114. 03 Depth-First Search/015 Cycle detection implementation I-subtitle-en.srt 10KB
  115. 05 Spanning Trees/039 Spanning trees introduction - lazy Prim's algorithm-subtitle-en.srt 10KB
  116. 03 Depth-First Search/016 Cycle detection implementation II-subtitle-en.srt 9KB
  117. 03 Depth-First Search/014 Cycle detection introduction-subtitle-en.srt 9KB
  118. 05 Spanning Trees/034 Union-find data structure illustration-subtitle-en.srt 9KB
  119. 04 Shortest Path Algorithms/031 Arbitrage situations on FOREX implementation-subtitle-en.srt 9KB
  120. 07 Maximum Flow Problem/054 Maximum flow introduction - basics-subtitle-en.srt 9KB
  121. 06 Strongly Connected Components/047 Kosaraju implementation I - the Graph class-subtitle-en.srt 9KB
  122. 07 Maximum Flow Problem/057 Maximum flow introduction - residual networks-subtitle-en.srt 9KB
  123. 05 Spanning Trees/041 Prims lazy algorithm implementation II - the core-subtitle-en.srt 8KB
  124. 06 Strongly Connected Components/045 Strongly connected components introduction-subtitle-en.srt 8KB
  125. 04 Shortest Path Algorithms/020 Dijkstra algorithm introduction - algorithm-subtitle-en.srt 8KB
  126. 07 Maximum Flow Problem/064 Maximum flow implementation IV - augmentation-subtitle-en.srt 8KB
  127. 04 Shortest Path Algorithms/019 Dijkstra algorithm introduction - basics-subtitle-en.srt 8KB
  128. 06 Strongly Connected Components/050 Tarjan algorithm introduction-subtitle-en.srt 8KB
  129. 04 Shortest Path Algorithms/028 Bellman-Ford algorithm implementation II-subtitle-en.srt 8KB
  130. 02 Breadth-First Search/006 BFS - WebCrawler (core of search engines)-subtitle-en.srt 7KB
  131. 06 Strongly Connected Components/048 Kosaraju implementation II-subtitle-en.srt 7KB
  132. 03 Depth-First Search/012 Topological ordering implementation I-subtitle-en.srt 7KB
  133. 03 Depth-First Search/013 Topological ordering implementation II-subtitle-en.srt 7KB
  134. 03 Depth-First Search/018 Memory management_ BFS vs DFS-subtitle-en.srt 7KB
  135. 07 Maximum Flow Problem/056 Maximum flow introduction - cuts-subtitle-en.srt 6KB
  136. 06 Strongly Connected Components/051 Tarjan implementation I-subtitle-en.srt 6KB
  137. 08 Travelling Salesman Problem (TSP)/072 TSP implementation with simulated annealing IV - testing-subtitle-en.srt 6KB
  138. 07 Maximum Flow Problem/058 Maximum flow introduction - Ford-Fulkerson algorithm-subtitle-en.srt 6KB
  139. 08 Travelling Salesman Problem (TSP)/074 Tabu search introduction II-subtitle-en.srt 6KB
  140. 07 Maximum Flow Problem/062 Maximum flow implementation II - FlowNetwork class-subtitle-en.srt 6KB
  141. 04 Shortest Path Algorithms/030 Arbitrage situations on FOREX introduction-subtitle-en.srt 5KB
  142. 04 Shortest Path Algorithms/032 Longest path implementation-subtitle-en.srt 5KB
  143. 03 Depth-First Search/010 DFS implementation II - with recursion-subtitle-en.srt 5KB
  144. 07 Maximum Flow Problem/066 Bipartite matching problem introduction-subtitle-en.srt 5KB
  145. 01 Introduction/001 Introduction-subtitle-en.srt 5KB
  146. 07 Maximum Flow Problem/060 Maximum flow introduction - applications-subtitle-en.srt 4KB
  147. 07 Maximum Flow Problem/065 Maximum flow implementation V - testing-subtitle-en.srt 4KB
  148. 10 Source Code & Slides/078 FINAL-COUPONS.txt 4KB
  149. 06 Strongly Connected Components/049 Kosaraju algorithm implementation III - test-subtitle-en.srt 3KB
  150. 08 Travelling Salesman Problem (TSP)/069 TSP.zip 3KB
  151. 06 Strongly Connected Components/052 Tarjan implementation II - test-subtitle-en.srt 3KB
  152. 07 Maximum Flow Problem/067 Bipartite matching implementation-subtitle-en.srt 3KB
  153. 10 Source Code & Slides/078 DISCOUNT FOR OTHER COURSES!.html 1KB
  154. 01 Introduction/003 Complexity theory.html 1KB
  155. 10 Source Code & Slides/076 Source code.html 1KB
  156. 10 Source Code & Slides/077 Slides.html 1KB
  157. 01 Introduction/003 free-complexity-theory.zip 264B
  158. [Discuss.FreeTutorials.us].url 252B
  159. [FreeCoursesOnline.Us].url 123B
  160. [FreeTutorials.Us].url 119B