Holczer Balazs - Advanced Algorithms in Java 2018

Creation Time	Feb. 15, 2024, 12:02 a.m.
Last Access Time	Oct. 17, 2025, 9:38 p.m.
File Size	1.3 GB
Keywords	Java Holczer - Algorithms 2018 in Balazs Advanced
Total Requests	1233
Total Files	157
Magnet Link	Please wait ...
	Download (Magnet Link) Play (Watch Online)

04 Shortest Path Algorithms/023 Dijkstra algorithm introduction - with adjacency matrix.mp4 35.8 MB
02 Breadth-First Search/007 BFS - WebCrawler implementation.mp4 33.1 MB
05 Spanning Trees/037 Kruskal algorithm implementation II - disjoint set.mp4 31.0 MB
04 Shortest Path Algorithms/027 Bellman-Ford algorithm implementation I.mp4 30.4 MB
03 Depth-First Search/017 Maze solving algorithm implementation.mp4 30.3 MB
08 Travelling Salesman Problem (TSP)/070 TSP implementation with simulated annealing II - tour.mp4 29.9 MB
09 Euler cycle - Chinese Postman Problem/075 Euler's cycles introduction.mp4 28.9 MB
08 Travelling Salesman Problem (TSP)/068 Travelling salesman problem introduction.mp4 24.7 MB
02 Breadth-First Search/005 BFS implementation.mp4 24.4 MB
05 Spanning Trees/040 Prims lazy algorithm implementation I.mp4 24.2 MB
07 Maximum Flow Problem/061 Maximum flow implementation I - Edge_ Vertex.mp4 24.1 MB
03 Depth-First Search/011 Topological ordering introduction.mp4 23.8 MB
05 Spanning Trees/042 Spanning trees introduction - eager Prim's algorithm.mp4 23.8 MB
05 Spanning Trees/043 Eager Prim's algorithm implementation.mp4 23.3 MB
05 Spanning Trees/033 Union-find data structure (disjoint sets).mp4 23.2 MB
03 Depth-First Search/009 DFS implementation I - with stack.mp4 23.0 MB
08 Travelling Salesman Problem (TSP)/071 TSP implementation with simulated annealing III - algorithm.mp4 23.0 MB
05 Spanning Trees/035 Spanning trees introduction - Kruskal algorithm.mp4 22.9 MB
04 Shortest Path Algorithms/021 Dijkstra algorithm introduction - example.mp4 22.9 MB
03 Depth-First Search/008 Depth-first search introduction.mp4 22.1 MB
08 Travelling Salesman Problem (TSP)/069 TSP implementation with simulated annealing I - city.mp4 21.9 MB
04 Shortest Path Algorithms/026 Dijkstra algorithm implementation II.mp4 21.9 MB
08 Travelling Salesman Problem (TSP)/073 Tabu search introduction.mp4 21.2 MB
07 Maximum Flow Problem/055 Maximum flow introduction - properties.mp4 20.9 MB
02 Breadth-First Search/004 Breadth-first search introduction.mp4 20.7 MB
05 Spanning Trees/038 Kruskal algorithm implementation III.mp4 20.7 MB
04 Shortest Path Algorithms/022 Bellman-Ford algorithm introduction.mp4 20.6 MB
04 Shortest Path Algorithms/029 DAG shortest path implementation.mp4 20.2 MB
04 Shortest Path Algorithms/024 Shortest path algorithms applications.mp4 20.0 MB
04 Shortest Path Algorithms/025 Dijkstra algorithm implementation I.mp4 19.6 MB
07 Maximum Flow Problem/059 Maximum flow introduction - example.mp4 19.2 MB
01 Introduction/002 Graph theory introduction.mp4 18.7 MB
02 Breadth-First Search/006 BFS - WebCrawler (core of search engines).mp4 18.3 MB
06 Strongly Connected Components/047 Kosaraju implementation I - the Graph class.mp4 17.5 MB
06 Strongly Connected Components/046 Kosaraju algorithm introduction.mp4 17.0 MB
06 Strongly Connected Components/045 Strongly connected components introduction.mp4 16.8 MB
05 Spanning Trees/044 Applications of spanning trees.mp4 16.8 MB
07 Maximum Flow Problem/063 Maximum flow implementation III - Ford-Fulkerson algorithm.mp4 16.8 MB
03 Depth-First Search/016 Cycle detection implementation II.mp4 16.8 MB
05 Spanning Trees/039 Spanning trees introduction - lazy Prim's algorithm.mp4 16.0 MB
05 Spanning Trees/036 Kruskal algorithm implementation I.mp4 15.9 MB
03 Depth-First Search/015 Cycle detection implementation I.mp4 15.8 MB
06 Strongly Connected Components/053 Applications of strongly connected components.mp4 15.6 MB
04 Shortest Path Algorithms/031 Arbitrage situations on FOREX implementation.mp4 15.6 MB
07 Maximum Flow Problem/057 Maximum flow introduction - residual networks.mp4 15.4 MB
07 Maximum Flow Problem/054 Maximum flow introduction - basics.mp4 15.0 MB
07 Maximum Flow Problem/064 Maximum flow implementation IV - augmentation.mp4 14.7 MB
06 Strongly Connected Components/048 Kosaraju implementation II.mp4 14.5 MB
05 Spanning Trees/041 Prims lazy algorithm implementation II - the core.mp4 14.4 MB
06 Strongly Connected Components/051 Tarjan implementation I.mp4 13.7 MB
03 Depth-First Search/014 Cycle detection introduction.mp4 13.5 MB
05 Spanning Trees/034 Union-find data structure illustration.mp4 13.3 MB
03 Depth-First Search/013 Topological ordering implementation II.mp4 13.1 MB
06 Strongly Connected Components/050 Tarjan algorithm introduction.mp4 13.1 MB
04 Shortest Path Algorithms/020 Dijkstra algorithm introduction - algorithm.mp4 12.9 MB
04 Shortest Path Algorithms/019 Dijkstra algorithm introduction - basics.mp4 12.3 MB
07 Maximum Flow Problem/056 Maximum flow introduction - cuts.mp4 12.2 MB
04 Shortest Path Algorithms/028 Bellman-Ford algorithm implementation II.mp4 12.1 MB
03 Depth-First Search/018 Memory management_ BFS vs DFS.mp4 11.8 MB
03 Depth-First Search/012 Topological ordering implementation I.mp4 11.4 MB
10 Source Code & Slides/077 AdvancedAlgosSlides.zip 11.1 MB
07 Maximum Flow Problem/062 Maximum flow implementation II - FlowNetwork class.mp4 11.1 MB
07 Maximum Flow Problem/058 Maximum flow introduction - Ford-Fulkerson algorithm.mp4 10.9 MB
08 Travelling Salesman Problem (TSP)/074 Tabu search introduction II.mp4 10.4 MB
08 Travelling Salesman Problem (TSP)/072 TSP implementation with simulated annealing IV - testing.mp4 9.2 MB
04 Shortest Path Algorithms/032 Longest path implementation.mp4 9.1 MB
07 Maximum Flow Problem/066 Bipartite matching problem introduction.mp4 8.5 MB
03 Depth-First Search/010 DFS implementation II - with recursion.mp4 8.4 MB
04 Shortest Path Algorithms/030 Arbitrage situations on FOREX introduction.mp4 8.2 MB
01 Introduction/001 Introduction.mp4 7.3 MB
07 Maximum Flow Problem/060 Maximum flow introduction - applications.mp4 7.1 MB
06 Strongly Connected Components/049 Kosaraju algorithm implementation III - test.mp4 7.0 MB
07 Maximum Flow Problem/065 Maximum flow implementation V - testing.mp4 6.8 MB
06 Strongly Connected Components/052 Tarjan implementation II - test.mp4 6.4 MB
07 Maximum Flow Problem/067 Bipartite matching implementation.mp4 6.1 MB
10 Source Code & Slides/076 GraphalgorithmsCode.zip 99.1 KB
03 Depth-First Search/017 Maze solving algorithm implementation-subtitle-en.srt 21.1 KB
05 Spanning Trees/037 Kruskal algorithm implementation II - disjoint set-subtitle-en.srt 18.7 KB
02 Breadth-First Search/007 BFS - WebCrawler implementation-subtitle-en.srt 17.0 KB
04 Shortest Path Algorithms/027 Bellman-Ford algorithm implementation I-subtitle-en.srt 16.3 KB
08 Travelling Salesman Problem (TSP)/070 TSP implementation with simulated annealing II - tour-subtitle-en.srt 15.8 KB
02 Breadth-First Search/005 BFS implementation-subtitle-en.srt 15.1 KB
05 Spanning Trees/043 Eager Prim's algorithm implementation-subtitle-en.srt 14.9 KB
05 Spanning Trees/033 Union-find data structure (disjoint sets)-subtitle-en.srt 14.9 KB
03 Depth-First Search/008 Depth-first search introduction-subtitle-en.srt 14.9 KB
05 Spanning Trees/042 Spanning trees introduction - eager Prim's algorithm-subtitle-en.srt 14.7 KB
08 Travelling Salesman Problem (TSP)/068 Travelling salesman problem introduction-subtitle-en.srt 14.6 KB
05 Spanning Trees/035 Spanning trees introduction - Kruskal algorithm-subtitle-en.srt 14.5 KB
03 Depth-First Search/011 Topological ordering introduction-subtitle-en.srt 14.1 KB
07 Maximum Flow Problem/061 Maximum flow implementation I - Edge_ Vertex-subtitle-en.srt 13.8 KB
04 Shortest Path Algorithms/021 Dijkstra algorithm introduction - example-subtitle-en.srt 13.7 KB
04 Shortest Path Algorithms/026 Dijkstra algorithm implementation II-subtitle-en.srt 13.6 KB
04 Shortest Path Algorithms/029 DAG shortest path implementation-subtitle-en.srt 13.3 KB
02 Breadth-First Search/004 Breadth-first search introduction-subtitle-en.srt 13.0 KB
09 Euler cycle - Chinese Postman Problem/075 Euler's cycles introduction-subtitle-en.srt 12.9 KB
03 Depth-First Search/009 DFS implementation I - with stack-subtitle-en.srt 12.6 KB
04 Shortest Path Algorithms/023 Dijkstra algorithm introduction - with adjacency matrix-subtitle-en.srt 12.5 KB
05 Spanning Trees/038 Kruskal algorithm implementation III-subtitle-en.srt 12.5 KB
05 Spanning Trees/040 Prims lazy algorithm implementation I-subtitle-en.srt 12.4 KB
04 Shortest Path Algorithms/025 Dijkstra algorithm implementation I-subtitle-en.srt 12.4 KB
08 Travelling Salesman Problem (TSP)/071 TSP implementation with simulated annealing III - algorithm-subtitle-en.srt 12.3 KB
08 Travelling Salesman Problem (TSP)/069 TSP implementation with simulated annealing I - city-subtitle-en.srt 12.0 KB
06 Strongly Connected Components/046 Kosaraju algorithm introduction-subtitle-en.srt 11.9 KB
04 Shortest Path Algorithms/022 Bellman-Ford algorithm introduction-subtitle-en.srt 11.8 KB
07 Maximum Flow Problem/055 Maximum flow introduction - properties-subtitle-en.srt 11.8 KB
08 Travelling Salesman Problem (TSP)/073 Tabu search introduction-subtitle-en.srt 11.7 KB
07 Maximum Flow Problem/059 Maximum flow introduction - example-subtitle-en.srt 11.4 KB
04 Shortest Path Algorithms/024 Shortest path algorithms applications-subtitle-en.srt 11.3 KB
05 Spanning Trees/036 Kruskal algorithm implementation I-subtitle-en.srt 10.7 KB
05 Spanning Trees/044 Applications of spanning trees-subtitle-en.srt 10.3 KB
01 Introduction/002 Graph theory introduction-subtitle-en.srt 10.2 KB
06 Strongly Connected Components/053 Applications of strongly connected components-subtitle-en.srt 9.8 KB
07 Maximum Flow Problem/063 Maximum flow implementation III - Ford-Fulkerson algorithm-subtitle-en.srt 9.7 KB
03 Depth-First Search/015 Cycle detection implementation I-subtitle-en.srt 9.7 KB
05 Spanning Trees/039 Spanning trees introduction - lazy Prim's algorithm-subtitle-en.srt 9.5 KB
03 Depth-First Search/016 Cycle detection implementation II-subtitle-en.srt 9.3 KB
03 Depth-First Search/014 Cycle detection introduction-subtitle-en.srt 9.2 KB
05 Spanning Trees/034 Union-find data structure illustration-subtitle-en.srt 9.2 KB
04 Shortest Path Algorithms/031 Arbitrage situations on FOREX implementation-subtitle-en.srt 9.1 KB
07 Maximum Flow Problem/054 Maximum flow introduction - basics-subtitle-en.srt 9.0 KB
06 Strongly Connected Components/047 Kosaraju implementation I - the Graph class-subtitle-en.srt 8.6 KB
07 Maximum Flow Problem/057 Maximum flow introduction - residual networks-subtitle-en.srt 8.6 KB
05 Spanning Trees/041 Prims lazy algorithm implementation II - the core-subtitle-en.srt 8.4 KB
06 Strongly Connected Components/045 Strongly connected components introduction-subtitle-en.srt 8.3 KB
04 Shortest Path Algorithms/020 Dijkstra algorithm introduction - algorithm-subtitle-en.srt 8.1 KB
07 Maximum Flow Problem/064 Maximum flow implementation IV - augmentation-subtitle-en.srt 8.1 KB
04 Shortest Path Algorithms/019 Dijkstra algorithm introduction - basics-subtitle-en.srt 7.9 KB
06 Strongly Connected Components/050 Tarjan algorithm introduction-subtitle-en.srt 7.7 KB
04 Shortest Path Algorithms/028 Bellman-Ford algorithm implementation II-subtitle-en.srt 7.6 KB
02 Breadth-First Search/006 BFS - WebCrawler (core of search engines)-subtitle-en.srt 7.5 KB
06 Strongly Connected Components/048 Kosaraju implementation II-subtitle-en.srt 7.4 KB
03 Depth-First Search/012 Topological ordering implementation I-subtitle-en.srt 7.3 KB
03 Depth-First Search/013 Topological ordering implementation II-subtitle-en.srt 7.0 KB
03 Depth-First Search/018 Memory management_ BFS vs DFS-subtitle-en.srt 6.7 KB
07 Maximum Flow Problem/056 Maximum flow introduction - cuts-subtitle-en.srt 6.5 KB
06 Strongly Connected Components/051 Tarjan implementation I-subtitle-en.srt 6.3 KB
08 Travelling Salesman Problem (TSP)/072 TSP implementation with simulated annealing IV - testing-subtitle-en.srt 6.1 KB
07 Maximum Flow Problem/058 Maximum flow introduction - Ford-Fulkerson algorithm-subtitle-en.srt 6.0 KB
08 Travelling Salesman Problem (TSP)/074 Tabu search introduction II-subtitle-en.srt 5.9 KB
07 Maximum Flow Problem/062 Maximum flow implementation II - FlowNetwork class-subtitle-en.srt 5.9 KB
04 Shortest Path Algorithms/030 Arbitrage situations on FOREX introduction-subtitle-en.srt 5.3 KB
04 Shortest Path Algorithms/032 Longest path implementation-subtitle-en.srt 5.3 KB
03 Depth-First Search/010 DFS implementation II - with recursion-subtitle-en.srt 5.2 KB
07 Maximum Flow Problem/066 Bipartite matching problem introduction-subtitle-en.srt 5.1 KB
01 Introduction/001 Introduction-subtitle-en.srt 5.0 KB
07 Maximum Flow Problem/060 Maximum flow introduction - applications-subtitle-en.srt 4.2 KB
07 Maximum Flow Problem/065 Maximum flow implementation V - testing-subtitle-en.srt 3.9 KB
10 Source Code & Slides/078 FINAL-COUPONS.txt 3.5 KB
06 Strongly Connected Components/049 Kosaraju algorithm implementation III - test-subtitle-en.srt 3.2 KB
08 Travelling Salesman Problem (TSP)/069 TSP.zip 3.1 KB
06 Strongly Connected Components/052 Tarjan implementation II - test-subtitle-en.srt 3.0 KB
07 Maximum Flow Problem/067 Bipartite matching implementation-subtitle-en.srt 2.9 KB
10 Source Code & Slides/078 DISCOUNT FOR OTHER COURSES!.html 1.3 KB
01 Introduction/003 Complexity theory.html 1.3 KB
10 Source Code & Slides/076 Source code.html 1.2 KB
10 Source Code & Slides/077 Slides.html 1.1 KB
01 Introduction/003 free-complexity-theory.zip 264 bytes

Holczer Balazs - Advanced Algorithms in Java 2018

File List

Download Torrent

Related Resources

Copyright Infringement