TorBT - Torrents and Magnet Links Search Engine
Holczer Balazs - Advanced Algorithms in Java
- Date: 2022-06-18
- Size: 1.4 GB
- Files: 52
File Name
Size
01 Introduction/002 Complexity theory.mp4
61 MB
01 Introduction/003 Graph theory - Hamiltonian and Eulerian cycles.mp4
31 MB
01 Introduction/001 Introduction.mp4
4.3 MB
02 Breadth First Search/003 BFS - WebCrawler core of search engines.mp4
41 MB
02 Breadth First Search/002 BFS implementation.mp4
23 MB
02 Breadth First Search/001 BFS introduction.mp4
11 MB
03 Depth First Search/006 Cycle detection.mp4
36 MB
03 Depth First Search/007 Maze solving algorithm.mp4
31 MB
03 Depth First Search/002 DFS implementation I - with stack.mp4
29 MB
03 Depth First Search/005 Topological ordering implementation.mp4
28 MB
03 Depth First Search/004 Topological ordering introduction.mp4
20 MB
03 Depth First Search/001 DFS introduction.mp4
9.9 MB
03 Depth First Search/003 DFS implementation II - with recursion.mp4
8.2 MB
04 Shortest Path/002 Dijkstra implementation.mp4
43 MB
04 Shortest Path/001 Shortest path introduction.mp4
38 MB
04 Shortest Path/006 Arbitrage situations.mp4
36 MB
04 Shortest Path/004 Bellman-Ford implementation.mp4
31 MB
04 Shortest Path/009 DAG shortest path.mp4
30 MB
04 Shortest Path/005 Optimizing and testing Bellman-Ford algorithm.mp4
28 MB
04 Shortest Path/007 Shortest path applications.mp4
19 MB
04 Shortest Path/008 Longest path.mp4
14 MB
04 Shortest Path/003 Bellman-Ford algorithm introduction.mp4
13 MB
05 Artificial Intelligence/003 A search implementation - algorithm.mp4
50 MB
05 Artificial Intelligence/001 Enhanced search algorithms introduction.mp4
49 MB
05 Artificial Intelligence/005 Iterative deepening DFS implementation.mp4
38 MB
05 Artificial Intelligence/002 A search implementation - Edge, Node.mp4
26 MB
05 Artificial Intelligence/004 A search implementation - test.mp4
25 MB
06 Spanning Trees/009 Testing Prims eager algorithm.mp4
43 MB
06 Spanning Trees/003 Kruskal algorithm - Union find data structure.mp4
43 MB
06 Spanning Trees/008 Eager version of Prims algorithm.mp4
41 MB
06 Spanning Trees/004 Testing Kruskal algorithm.mp4
33 MB
06 Spanning Trees/006 Prims lazy algorithm - the core.mp4
33 MB
06 Spanning Trees/001 Spanning trees introduction.mp4
32 MB
06 Spanning Trees/007 Testing Prims lazy algorithm.mp4
31 MB
06 Spanning Trees/002 Kruskal algorithm.mp4
18 MB
06 Spanning Trees/005 Prims lazy algorithm.mp4
16 MB
07 Strongly Connected Components/005 Tarjan implementation.mp4
41 MB
07 Strongly Connected Components/002 Kosaraju implementation - the Graph class.mp4
35 MB
07 Strongly Connected Components/003 Kosaraju implementation - transpose graph.mp4
35 MB
07 Strongly Connected Components/001 Strongly connected components introduction.mp4
24 MB
07 Strongly Connected Components/004 Testing Kosaraju algorithm.mp4
8.2 MB
07 Strongly Connected Components/006 Testing the Tarjan algorithm.mp4
5.2 MB
08 Maximum Flow Problem/002 Maximum flow implementation.mp4
53 MB
08 Maximum Flow Problem/001 Maximum flow introduction.mp4
33 MB
08 Maximum Flow Problem/004 Bipartite matching implementation.mp4
16 MB
08 Maximum Flow Problem/003 Bipartite matching problem.mp4
14 MB
09 Travelling Salesman Problem/002 TSP - implementation Simulated Annealing .mp4
72 MB
09 Travelling Salesman Problem/001 TSP - introduction.mp4
26 MB
10 Euler cycle - Chinese Postman Problem/001 Euler cycles.mp4
29 MB
11 Outro/001 Final words.mp4
8.5 MB
12 Source Code/002 Coupon codes - get any of my other courses for 10.html
1.3 kB
12 Source Code/001 Source code.html
1.2 kB