Movies
[FreeCourseSite com] Udemy - Advanced Algorithms in Java
Torrent info
Torrent Files List
0. Websites you may like (Size: 2.71 GB) (Files: 319)
0. Websites you may like
[CourseClub.ME].url
[FCS Forum].url
[FreeCourseSite.com].url
01 Introduction
001 Introduction-subtitle-en.srt
001 Introduction.mp4
002 Graph theory introduction-subtitle-en.srt
002 Graph theory introduction.mp4
003 Complexity theory.html
003 free-complexity-theory.zip
02 Breadth-First Search
004 Breadth-first search introduction-subtitle-en.srt
004 Breadth-first search introduction.mp4
005 BFS implementation-subtitle-en.srt
005 BFS implementation.mp4
006 BFS - WebCrawler (core of search engines)-subtitle-en.srt
006 BFS - WebCrawler (core of search engines).mp4
007 BFS - WebCrawler implementation-subtitle-en.srt
007 BFS - WebCrawler implementation.mp4
03 Depth-First Search
008 Depth-first search introduction-subtitle-en.srt
008 Depth-first search introduction.mp4
009 DFS implementation I - with stack-subtitle-en.srt
009 DFS implementation I - with stack.mp4
010 DFS implementation II - with recursion-subtitle-en.srt
010 DFS implementation II - with recursion.mp4
011 Topological ordering introduction-subtitle-en.srt
011 Topological ordering introduction.mp4
012 Topological ordering implementation I-subtitle-en.srt
012 Topological ordering implementation I.mp4
013 Topological ordering implementation II-subtitle-en.srt
013 Topological ordering implementation II.mp4
014 Cycle detection introduction-subtitle-en.srt
014 Cycle detection introduction.mp4
015 Cycle detection implementation I-subtitle-en.srt
015 Cycle detection implementation I.mp4
016 Cycle detection implementation II-subtitle-en.srt
016 Cycle detection implementation II.mp4
017 Maze solving algorithm implementation-subtitle-en.srt
017 Maze solving algorithm implementation.mp4
018 Memory management_ BFS vs DFS-subtitle-en.srt
018 Memory management_ BFS vs DFS.mp4
04 Shortest Path Algorithms
019 Dijkstra algorithm introduction - basics-subtitle-en.srt
019 Dijkstra algorithm introduction - basics.mp4
020 Dijkstra algorithm introduction - algorithm-subtitle-en.srt
020 Dijkstra algorithm introduction - algorithm.mp4
021 Dijkstra algorithm introduction - example-subtitle-en.srt
021 Dijkstra algorithm introduction - example.mp4
022 Bellman-Ford algorithm introduction-subtitle-en.srt
022 Bellman-Ford algorithm introduction.mp4
023 Dijkstra algorithm introduction - with adjacency matrix-subtitle-en.srt
023 Dijkstra algorithm introduction - with adjacency matrix.mp4
024 Shortest path algorithms applications-subtitle-en.srt
024 Shortest path algorithms applications.mp4
025 Dijkstra algorithm implementation I-subtitle-en.srt
025 Dijkstra algorithm implementation I.mp4
026 Dijkstra algorithm implementation II-subtitle-en.srt
026 Dijkstra algorithm implementation II.mp4
027 Bellman-Ford algorithm implementation I-subtitle-en.srt
027 Bellman-Ford algorithm implementation I.mp4
028 Bellman-Ford algorithm implementation II-subtitle-en.srt
028 Bellman-Ford algorithm implementation II.mp4
029 DAG shortest path implementation-subtitle-en.srt
029 DAG shortest path implementation.mp4
030 Arbitrage situations on FOREX introduction-subtitle-en.srt
030 Arbitrage situations on FOREX introduction.mp4
031 Arbitrage situations on FOREX implementation-subtitle-en.srt
031 Arbitrage situations on FOREX implementation.mp4
032 Longest path implementation-subtitle-en.srt
032 Longest path implementation.mp4
05 Spanning Trees
033 Union-find data structure (disjoint sets)-subtitle-en.srt
033 Union-find data structure (disjoint sets).mp4
034 Union-find data structure illustration-subtitle-en.srt
034 Union-find data structure illustration.mp4
035 Spanning trees introduction - Kruskal algorithm-subtitle-en.srt
035 Spanning trees introduction - Kruskal algorithm.mp4
036 Kruskal algorithm implementation I-subtitle-en.srt
036 Kruskal algorithm implementation I.mp4
037 Kruskal algorithm implementation II - disjoint set-subtitle-en.srt
037 Kruskal algorithm implementation II - disjoint set.mp4
038 Kruskal algorithm implementation III-subtitle-en.srt
038 Kruskal algorithm implementation III.mp4
039 Spanning trees introduction - lazy Prim's algorithm-subtitle-en.srt
039 Spanning trees introduction - lazy Prim's algorithm.mp4
040 Prims lazy algorithm implementation I-subtitle-en.srt
040 Prims lazy algorithm implementation I.mp4
041 Prims lazy algorithm implementation II - the core-subtitle-en.srt
041 Prims lazy algorithm implementation II - the core.mp4
042 Spanning trees introduction - eager Prim's algorithm-subtitle-en.srt
042 Spanning trees introduction - eager Prim's algorithm.mp4
043 Eager Prim's algorithm implementation-subtitle-en.srt
043 Eager Prim's algorithm implementation.mp4
044 Applications of spanning trees-subtitle-en.srt
044 Applications of spanning trees.mp4
06 Strongly Connected Components
045 Strongly connected components introduction-subtitle-en.srt
045 Strongly connected components introduction.mp4
046 Kosaraju algorithm introduction-subtitle-en.srt
046 Kosaraju algorithm introduction.mp4
047 Kosaraju implementation I - the Graph class-subtitle-en.srt
047 Kosaraju implementation I - the Graph class.mp4
048 Kosaraju implementation II-subtitle-en.srt
048 Kosaraju implementation II.mp4
049 Kosaraju algorithm implementation III - test-subtitle-en.srt
049 Kosaraju algorithm implementation III - test.mp4
050 Tarjan algorithm introduction-subtitle-en.srt
050 Tarjan algorithm introduction.mp4
051 Tarjan implementation I-subtitle-en.srt
051 Tarjan implementation I.mp4
052 Tarjan implementation II - test-subtitle-en.srt
052 Tarjan implementation II - test.mp4
053 Applications of strongly connected components-subtitle-en.srt
053 Applications of strongly connected components.mp4
07 Maximum Flow Problem
054 Maximum flow introduction - basics-subtitle-en.srt
054 Maximum flow introduction - basics.mp4
055 Maximum flow introduction - properties-subtitle-en.srt
055 Maximum flow introduction - properties.mp4
056 Maximum flow introduction - cuts-subtitle-en.srt
056 Maximum flow introduction - cuts.mp4
057 Maximum flow introduction - residual networks-subtitle-en.srt
057 Maximum flow introduction - residual networks.mp4
058 Maximum flow introduction - Ford-Fulkerson algorithm-subtitle-en.srt
058 Maximum flow introduction - Ford-Fulkerson algorithm.mp4
059 Maximum flow introduction - example-subtitle-en.srt
059 Maximum flow introduction - example.mp4
060 Maximum flow introduction - applications-subtitle-en.srt
060 Maximum flow introduction - applications.mp4
061 Maximum flow implementation I - Edge_ Vertex-subtitle-en.srt
061 Maximum flow implementation I - Edge_ Vertex.mp4
062 Maximum flow implementation II - FlowNetwork class-subtitle-en.srt
062 Maximum flow implementation II - FlowNetwork class.mp4
063 Maximum flow implementation III - Ford-Fulkerson algorithm-subtitle-en.srt
063 Maximum flow implementation III - Ford-Fulkerson algorithm.mp4
064 Maximum flow implementation IV - augmentation-subtitle-en.srt
064 Maximum flow implementation IV - augmentation.mp4
065 Maximum flow implementation V - testing-subtitle-en.srt
065 Maximum flow implementation V - testing.mp4
066 Bipartite matching problem introduction-subtitle-en.srt
066 Bipartite matching problem introduction.mp4
067 Bipartite matching implementation-subtitle-en.srt
067 Bipartite matching implementation.mp4
08 Travelling Salesman Problem (TSP)
068 Travelling salesman problem introduction-subtitle-en.srt
068 Travelling salesman problem introduction.mp4
069 TSP implementation with simulated annealing I - city-subtitle-en.srt
069 TSP implementation with simulated annealing I - city.mp4
069 TSP.zip
070 TSP implementation with simulated annealing II - tour-subtitle-en.srt
070 TSP implementation with simulated annealing II - tour.mp4
071 TSP implementation with simulated annealing III - algorithm-subtitle-en.srt
071 TSP implementation with simulated annealing III - algorithm.mp4
072 TSP implementation with simulated annealing IV - testing-subtitle-en.srt
072 TSP implementation with simulated annealing IV - testing.mp4
073 Tabu search introduction-subtitle-en.srt
073 Tabu search introduction.mp4
074 Tabu search introduction II-subtitle-en.srt
074 Tabu search introduction II.mp4
09 Euler cycle - Chinese Postman Problem
075 Euler's cycles introduction-subtitle-en.srt
075 Euler's cycles introduction.mp4
1. Introduction
1. Introduction.mp4
1. Introduction.vtt
2. Graph theory introduction.mp4
2. Graph theory introduction.vtt
10 Source Code & Slides
076 GraphalgorithmsCode.zip
076 Source code.html
077 AdvancedAlgosSlides.zip
077 Slides.html
078 DISCOUNT FOR OTHER COURSES!.html
078 FINAL-COUPONS.txt
10. Course Materials (DOWNLOADS)
1. Course materials.html
1.1 AdvancedAlgorithmsJava.zip.zip
11. DISCOUNT FOR OTHER COURSES!
1. 90% OFF For Other Courses.html
2. Breadth-First Search
1. Breadth-first search introduction.mp4
1. Breadth-first search introduction.vtt
2. BFS implementation.mp4
2. BFS implementation.vtt
3. BFS - WebCrawler (core of search engines).mp4
3. BFS - WebCrawler (core of search engines).vtt
4. BFS - WebCrawler implementation.mp4
4. BFS - WebCrawler implementation.vtt
3. Depth-First Search
1. Depth-first search introduction.mp4
1. Depth-first search introduction.vtt
10. Maze solving algorithm implementation.mp4
10. Maze solving algorithm implementation.vtt
11. Memory management BFS vs DFS.mp4
11. Memory management BFS vs DFS.vtt
12. Graph traversal quiz.html
2. DFS implementation I - with stack.mp4
2. DFS implementation I - with stack.vtt
3. DFS implementation II - with recursion.mp4
3. DFS implementation II - with recursion.vtt
4. Topological ordering introduction.mp4
4. Topological ordering introduction.vtt
5. Topological ordering implementation I.mp4
5. Topological ordering implementation I.vtt
6. Topological ordering implementation II.mp4
6. Topological ordering implementation II.vtt
7. Cycle detection introduction.mp4
7. Cycle detection introduction.vtt
8. Cycle detection implementation I.mp4
8. Cycle detection implementation I.vtt
9. Cycle detection implementation II.mp4
9. Cycle detection implementation II.vtt
4. Shortest Path Algorithms
1. Dijkstra algorithm introduction - basics.mp4
1. Dijkstra algorithm introduction - basics.vtt
10. Bellman-Ford algorithm implementation II.mp4
10. Bellman-Ford algorithm implementation II.vtt
11. DAG shortest path implementation.mp4
11. DAG shortest path implementation.vtt
12. Arbitrage situations on FOREX introduction.mp4
12. Arbitrage situations on FOREX introduction.vtt
13. Arbitrage situations on FOREX implementation.mp4
13. Arbitrage situations on FOREX implementation.vtt
14. Longest path implementation.mp4
14. Longest path implementation.vtt
15. Shortest path algorithms quiz.html
2. Dijkstra algorithm introduction - algorithm.mp4
2. Dijkstra algorithm introduction - algorithm.vtt
3. Dijkstra algorithm introduction - example.mp4
3. Dijkstra algorithm introduction - example.vtt
4. Bellman-Ford algorithm introduction.mp4
4. Bellman-Ford algorithm introduction.vtt
5. Dijkstra algorithm introduction - with adjacency matrix.mp4
5. Dijkstra algorithm introduction - with adjacency matrix.vtt
6. Shortest path algorithms applications.mp4
6. Shortest path algorithms applications.vtt
7. Dijkstra algorithm implementation I.mp4
7. Dijkstra algorithm implementation I.vtt
8. Dijkstra algorithm implementation II.mp4
8. Dijkstra algorithm implementation II.vtt
9. Bellman-Ford algorithm implementation I.mp4
9. Bellman-Ford algorithm implementation I.vtt
5. Spanning Trees
1. Union-find data structure (disjoint sets).mp4
1. Union-find data structure (disjoint sets).vtt
10. Spanning trees introduction - eager Prim's algorithm.mp4
10. Spanning trees introduction - eager Prim's algorithm.vtt
11. Eager Prim's algorithm implementation.mp4
11. Eager Prim's algorithm implementation.vtt
12. Applications of spanning trees.mp4
12. Applications of spanning trees.vtt
13. Spanning trees quiz.html
2. Union-find data structure illustration.mp4
2. Union-find data structure illustration.vtt
3. Spanning trees introduction - Kruskal algorithm.mp4
3. Spanning trees introduction - Kruskal algorithm.vtt
4. Kruskal algorithm implementation I.mp4
4. Kruskal algorithm implementation I.vtt
5. Kruskal algorithm implementation II - disjoint set.mp4
5. Kruskal algorithm implementation II - disjoint set.vtt
6. Kruskal algorithm implementation III.mp4
6. Kruskal algorithm implementation III.vtt
7. Spanning trees introduction - lazy Prim's algorithm.mp4
7. Spanning trees introduction - lazy Prim's algorithm.vtt
8. Prims lazy algorithm implementation I.mp4
8. Prims lazy algorithm implementation I.vtt
9. Prims lazy algorithm implementation II - the core.mp4
9. Prims lazy algorithm implementation II - the core.vtt
6. Strongly Connected Components
1. Strongly connected components introduction.mp4
1. Strongly connected components introduction.vtt
10. Strongly connected components quiz.html
2. Kosaraju algorithm introduction.mp4
2. Kosaraju algorithm introduction.vtt
3. Kosaraju implementation I - the Graph class.mp4
3. Kosaraju implementation I - the Graph class.vtt
4. Kosaraju implementation II.mp4
4. Kosaraju implementation II.vtt
5. Kosaraju algorithm implementation III - test.mp4
5. Kosaraju algorithm implementation III - test.vtt
6. Tarjan algorithm introduction.mp4
6. Tarjan algorithm introduction.vtt
7. Tarjan implementation I.mp4
7. Tarjan implementation I.vtt
8. Tarjan implementation II - test.mp4
8. Tarjan implementation II - test.vtt
9. Applications of strongly connected components.mp4
9. Applications of strongly connected components.vtt
7. Maximum Flow Problem
1. Maximum flow introduction - basics.mp4
1. Maximum flow introduction - basics.vtt
10. Maximum flow implementation III - Ford-Fulkerson algorithm.mp4
10. Maximum flow implementation III - Ford-Fulkerson algorithm.vtt
11. Maximum flow implementation IV - augmentation.mp4
11. Maximum flow implementation IV - augmentation.vtt
12. Maximum flow implementation V - testing.mp4
12. Maximum flow implementation V - testing.vtt
13. Bipartite matching problem introduction.mp4
13. Bipartite matching problem introduction.vtt
14. Bipartite matching implementation.mp4
14. Bipartite matching implementation.vtt
2. Maximum flow introduction - properties.mp4
2. Maximum flow introduction - properties.vtt
3. Maximum flow introduction - cuts.mp4
3. Maximum flow introduction - cuts.vtt
4. Maximum flow introduction - residual networks.mp4
4. Maximum flow introduction - residual networks.vtt
5. Maximum flow introduction - Ford-Fulkerson algorithm.mp4
5. Maximum flow introduction - Ford-Fulkerson algorithm.vtt
6. Maximum flow introduction - example.mp4
6. Maximum flow introduction - example.vtt
7. Maximum flow introduction - applications.mp4
7. Maximum flow introduction - applications.vtt
8. Maximum flow implementation I - Edge, Vertex.mp4
8. Maximum flow implementation I - Edge, Vertex.vtt
9. Maximum flow implementation II - FlowNetwork class.mp4
9. Maximum flow implementation II - FlowNetwork class.vtt
8. Travelling Salesman Problem (TSP)
1. Travelling salesman problem introduction.mp4
1. Travelling salesman problem introduction.vtt
2. TSP implementation with simulated annealing I - city.mp4
2. TSP implementation with simulated annealing I - city.vtt
2.1 TSP.zip
3. TSP implementation with simulated annealing II - tour.mp4
3. TSP implementation with simulated annealing II - tour.vtt
4. TSP implementation with simulated annealing III - algorithm.mp4
4. TSP implementation with simulated annealing III - algorithm.vtt
5. TSP implementation with simulated annealing IV - testing.mp4
5. TSP implementation with simulated annealing IV - testing.vtt
6. Tabu search introduction.mp4
6. Tabu search introduction.vtt
7. Tabu search introduction II.mp4
7. Tabu search introduction II.vtt
8. Travelling salesman problem quiz.html
9. Euler cycle - Chinese Postman Problem
1. Euler's cycles introduction.mp4
1. Euler's cycles introduction.vtt
[CourseClub.NET].url
[FreeCourseSite.com].url
Torrent description
Feel free to post any comments about this torrent, including links to Subtitle, samples, screenshots, or any other relevant information, Watch [FreeCourseSite com] Udemy - Advanced Algorithms in Java Online Free Full Movies Like 123Movies, Putlockers, Fmovies, Netflix or Download Direct via Magnet Link in Torrent Details.
