589689.xyz

Holczer Balazs - Advanced Algorithms in Java

  • 收录时间:2018-02-26 00:20:49
  • 文件大小:1GB
  • 下载次数:133
  • 最近下载:2021-01-02 03:43:49
  • 磁力链接:
立即下载 复制链接

文件列表

  1. 09 Travelling Salesman Problem/002 TSP - implementation Simulated Annealing .mp4 72MB
  2. 01 Introduction/002 Complexity theory.mp4 61MB
  3. 08 Maximum Flow Problem/002 Maximum flow implementation.mp4 53MB
  4. 05 Artificial Intelligence/003 A search implementation - algorithm.mp4 50MB
  5. 05 Artificial Intelligence/001 Enhanced search algorithms introduction.mp4 49MB
  6. 06 Spanning Trees/009 Testing Prims eager algorithm.mp4 43MB
  7. 04 Shortest Path/002 Dijkstra implementation.mp4 43MB
  8. 06 Spanning Trees/003 Kruskal algorithm - Union find data structure.mp4 43MB
  9. 07 Strongly Connected Components/005 Tarjan implementation.mp4 41MB
  10. 02 Breadth First Search/003 BFS - WebCrawler core of search engines.mp4 41MB
  11. 06 Spanning Trees/008 Eager version of Prims algorithm.mp4 41MB
  12. 05 Artificial Intelligence/005 Iterative deepening DFS implementation.mp4 38MB
  13. 04 Shortest Path/001 Shortest path introduction.mp4 38MB
  14. 03 Depth First Search/006 Cycle detection.mp4 36MB
  15. 04 Shortest Path/006 Arbitrage situations.mp4 36MB
  16. 07 Strongly Connected Components/002 Kosaraju implementation - the Graph class.mp4 35MB
  17. 07 Strongly Connected Components/003 Kosaraju implementation - transpose graph.mp4 35MB
  18. 06 Spanning Trees/004 Testing Kruskal algorithm.mp4 33MB
  19. 06 Spanning Trees/006 Prims lazy algorithm - the core.mp4 33MB
  20. 08 Maximum Flow Problem/001 Maximum flow introduction.mp4 33MB
  21. 06 Spanning Trees/001 Spanning trees introduction.mp4 32MB
  22. 03 Depth First Search/007 Maze solving algorithm.mp4 31MB
  23. 01 Introduction/003 Graph theory - Hamiltonian and Eulerian cycles.mp4 31MB
  24. 04 Shortest Path/004 Bellman-Ford implementation.mp4 31MB
  25. 06 Spanning Trees/007 Testing Prims lazy algorithm.mp4 31MB
  26. 04 Shortest Path/009 DAG shortest path.mp4 30MB
  27. 03 Depth First Search/002 DFS implementation I - with stack.mp4 29MB
  28. 10 Euler cycle - Chinese Postman Problem/001 Euler cycles.mp4 29MB
  29. 03 Depth First Search/005 Topological ordering implementation.mp4 28MB
  30. 04 Shortest Path/005 Optimizing and testing Bellman-Ford algorithm.mp4 28MB
  31. 05 Artificial Intelligence/002 A search implementation - Edge, Node.mp4 26MB
  32. 09 Travelling Salesman Problem/001 TSP - introduction.mp4 26MB
  33. 05 Artificial Intelligence/004 A search implementation - test.mp4 25MB
  34. 07 Strongly Connected Components/001 Strongly connected components introduction.mp4 24MB
  35. 02 Breadth First Search/002 BFS implementation.mp4 23MB
  36. 03 Depth First Search/004 Topological ordering introduction.mp4 20MB
  37. 04 Shortest Path/007 Shortest path applications.mp4 19MB
  38. 06 Spanning Trees/002 Kruskal algorithm.mp4 18MB
  39. 06 Spanning Trees/005 Prims lazy algorithm.mp4 16MB
  40. 08 Maximum Flow Problem/004 Bipartite matching implementation.mp4 16MB
  41. 08 Maximum Flow Problem/003 Bipartite matching problem.mp4 14MB
  42. 04 Shortest Path/008 Longest path.mp4 14MB
  43. 04 Shortest Path/003 Bellman-Ford algorithm introduction.mp4 13MB
  44. 02 Breadth First Search/001 BFS introduction.mp4 11MB
  45. 03 Depth First Search/001 DFS introduction.mp4 10MB
  46. 11 Outro/001 Final words.mp4 8MB
  47. 03 Depth First Search/003 DFS implementation II - with recursion.mp4 8MB
  48. 07 Strongly Connected Components/004 Testing Kosaraju algorithm.mp4 8MB
  49. 07 Strongly Connected Components/006 Testing the Tarjan algorithm.mp4 5MB
  50. 01 Introduction/001 Introduction.mp4 4MB
  51. 12 Source Code/002 Coupon codes - get any of my other courses for 10.html 1KB
  52. 12 Source Code/001 Source code.html 1KB