Name Holczer Balazs - Advanced Algorithms in Java 2018

File Type video

Size 1.28GB

UpdateDate 2024-7-4

hash *****8355B396261BBF602B9594CAACD35B8C25

Hot 10

Files 04 Shortest Path Algorithms/023 Dijkstra algorithm introduction - with adjacency matrix.mp4 | 35.83MB 01 Introduction/001 Introduction.mp4 | 7.27MB 01 Introduction/002 Graph theory introduction-subtitle-en.srt | 10.20KB 01 Introduction/002 Graph theory introduction.mp4 | 18.70MB 01 Introduction/003 Complexity theory.html | 1.25KB 01 Introduction/003 free-complexity-theory.zip | 264B 02 Breadth-First Search/004 Breadth-first search introduction-subtitle-en.srt | 13.00KB 02 Breadth-First Search/004 Breadth-first search introduction.mp4 | 20.74MB 02 Breadth-First Search/005 BFS implementation-subtitle-en.srt | 15.08KB 02 Breadth-First Search/005 BFS implementation.mp4 | 24.42MB 02 Breadth-First Search/006 BFS - WebCrawler (core of search engines)-subtitle-en.srt | 7.48KB 02 Breadth-First Search/006 BFS - WebCrawler (core of search engines).mp4 | 18.26MB 02 Breadth-First Search/007 BFS - WebCrawler implementation-subtitle-en.srt | 17.02KB 02 Breadth-First Search/007 BFS - WebCrawler implementation.mp4 | 33.10MB 03 Depth-First Search/008 Depth-first search introduction-subtitle-en.srt | 14.85KB 03 Depth-First Search/008 Depth-first search introduction.mp4 | 22.14MB 03 Depth-First Search/009 DFS implementation I - with stack-subtitle-en.srt | 12.59KB 03 Depth-First Search/009 DFS implementation I - with stack.mp4 | 23.03MB 03 Depth-First Search/010 DFS implementation II - with recursion-subtitle-en.srt | 5.20KB 03 Depth-First Search/010 DFS implementation II - with recursion.mp4 | 8.35MB 03 Depth-First Search/011 Topological ordering introduction-subtitle-en.srt | 14.14KB 03 Depth-First Search/011 Topological ordering introduction.mp4 | 23.80MB 03 Depth-First Search/012 Topological ordering implementation I-subtitle-en.srt | 7.34KB 03 Depth-First Search/012 Topological ordering implementation I.mp4 | 11.45MB 03 Depth-First Search/013 Topological ordering implementation II-subtitle-en.srt | 7.04KB 03 Depth-First Search/013 Topological ordering implementation II.mp4 | 13.06MB 03 Depth-First Search/014 Cycle detection introduction-subtitle-en.srt | 9.24KB 03 Depth-First Search/014 Cycle detection introduction.mp4 | 13.52MB 03 Depth-First Search/015 Cycle detection implementation I-subtitle-en.srt | 9.67KB 03 Depth-First Search/015 Cycle detection implementation I.mp4 | 15.78MB 03 Depth-First Search/016 Cycle detection implementation II-subtitle-en.srt | 9.34KB 03 Depth-First Search/016 Cycle detection implementation II.mp4 | 16.77MB 03 Depth-First Search/017 Maze solving algorithm implementation-subtitle-en.srt | 21.06KB 03 Depth-First Search/017 Maze solving algorithm implementation.mp4 | 30.29MB 03 Depth-First Search/018 Memory management_ BFS vs DFS-subtitle-en.srt | 6.70KB 03 Depth-First Search/018 Memory management_ BFS vs DFS.mp4 | 11.83MB 04 Shortest Path Algorithms/019 Dijkstra algorithm introduction - basics-subtitle-en.srt | 7.90KB 04 Shortest Path Algorithms/019 Dijkstra algorithm introduction - basics.mp4 | 12.30MB 04 Shortest Path Algorithms/020 Dijkstra algorithm introduction - algorithm-subtitle-en.srt | 8.12KB 04 Shortest Path Algorithms/020 Dijkstra algorithm introduction - algorithm.mp4 | 12.92MB 04 Shortest Path Algorithms/021 Dijkstra algorithm introduction - example-subtitle-en.srt | 13.73KB 04 Shortest Path Algorithms/021 Dijkstra algorithm introduction - example.mp4 | 22.85MB 04 Shortest Path Algorithms/022 Bellman-Ford algorithm introduction-subtitle-en.srt | 11.84KB 04 Shortest Path Algorithms/022 Bellman-Ford algorithm introduction.mp4 | 20.60MB 04 Shortest Path Algorithms/023 Dijkstra algorithm introduction - with adjacency matrix-subtitle-en.srt | 12.50KB 01 Introduction/001 Introduction-subtitle-en.srt | 5.04KB 04 Shortest Path Algorithms/024 Shortest path algorithms applications-subtitle-en.srt | 11.35KB 04 Shortest Path Algorithms/024 Shortest path algorithms applications.mp4 | 19.98MB 04 Shortest Path Algorithms/025 Dijkstra algorithm implementation I-subtitle-en.srt | 12.36KB 04 Shortest Path Algorithms/025 Dijkstra algorithm implementation I.mp4 | 19.62MB 04 Shortest Path Algorithms/026 Dijkstra algorithm implementation II-subtitle-en.srt | 13.63KB 04 Shortest Path Algorithms/026 Dijkstra algorithm implementation II.mp4 | 21.90MB 04 Shortest Path Algorithms/027 Bellman-Ford algorithm implementation I-subtitle-en.srt | 16.29KB 04 Shortest Path Algorithms/027 Bellman-Ford algorithm implementation I.mp4 | 30.40MB 04 Shortest Path Algorithms/028 Bellman-Ford algorithm implementation II-subtitle-en.srt | 7.64KB 04 Shortest Path Algorithms/028 Bellman-Ford algorithm implementation II.mp4 | 12.06MB 04 Shortest Path Algorithms/029 DAG shortest path implementation-subtitle-en.srt | 13.34KB 04 Shortest Path Algorithms/029 DAG shortest path implementation.mp4 | 20.18MB 04 Shortest Path Algorithms/030 Arbitrage situations on FOREX introduction-subtitle-en.srt | 5.32KB 04 Shortest Path Algorithms/030 Arbitrage situations on FOREX introduction.mp4 | 8.23MB 04 Shortest Path Algorithms/031 Arbitrage situations on FOREX implementation-subtitle-en.srt | 9.12KB 04 Shortest Path Algorithms/031 Arbitrage situations on FOREX implementation.mp4 | 15.56MB 04 Shortest Path Algorithms/032 Longest path implementation-subtitle-en.srt | 5.30KB 04 Shortest Path Algorithms/032 Longest path implementation.mp4 | 9.06MB 05 Spanning Trees/033 Union-find data structure (disjoint sets)-subtitle-en.srt | 14.88KB 05 Spanning Trees/033 Union-find data structure (disjoint sets).mp4 | 23.15MB 05 Spanning Trees/034 Union-find data structure illustration-subtitle-en.srt | 9.23KB 05 Spanning Trees/034 Union-find data structure illustration.mp4 | 13.30MB 05 Spanning Trees/035 Spanning trees introduction - Kruskal algorithm-subtitle-en.srt | 14.52KB 05 Spanning Trees/035 Spanning trees introduction - Kruskal algorithm.mp4 | 22.92MB 05 Spanning Trees/036 Kruskal algorithm implementation I-subtitle-en.srt | 10.70KB 05 Spanning Trees/036 Kruskal algorithm implementation I.mp4 | 15.86MB 05 Spanning Trees/037 Kruskal algorithm implementation II - disjoint set-subtitle-en.srt | 18.68KB 05 Spanning Trees/037 Kruskal algorithm implementation II - disjoint set.mp4 | 31.05MB 05 Spanning Trees/038 Kruskal algorithm implementation III-subtitle-en.srt | 12.46KB 05 Spanning Trees/038 Kruskal algorithm implementation III.mp4 | 20.73MB 05 Spanning Trees/039 Spanning trees introduction - lazy Prim's algorithm-subtitle-en.srt | 9.54KB 05 Spanning Trees/039 Spanning trees introduction - lazy Prim's algorithm.mp4 | 15.95MB 05 Spanning Trees/040 Prims lazy algorithm implementation I-subtitle-en.srt | 12.37KB 05 Spanning Trees/040 Prims lazy algorithm implementation I.mp4 | 24.24MB 05 Spanning Trees/041 Prims lazy algorithm implementation II - the core-subtitle-en.srt | 8.43KB 05 Spanning Trees/041 Prims lazy algorithm implementation II - the core.mp4 | 14.37MB 05 Spanning Trees/042 Spanning trees introduction - eager Prim's algorithm-subtitle-en.srt | 14.73KB 05 Spanning Trees/042 Spanning trees introduction - eager Prim's algorithm.mp4 | 23.75MB 05 Spanning Trees/043 Eager Prim's algorithm implementation-subtitle-en.srt | 14.94KB 05 Spanning Trees/043 Eager Prim's algorithm implementation.mp4 | 23.28MB 05 Spanning Trees/044 Applications of spanning trees-subtitle-en.srt | 10.35KB 05 Spanning Trees/044 Applications of spanning trees.mp4 | 16.78MB 06 Strongly Connected Components/045 Strongly connected components introduction-subtitle-en.srt | 8.27KB 06 Strongly Connected Components/045 Strongly connected components introduction.mp4 | 16.80MB 06 Strongly Connected Components/046 Kosaraju algorithm introduction-subtitle-en.srt | 11.88KB 06 Strongly Connected Components/046 Kosaraju algorithm introduction.mp4 | 17.00MB 06 Strongly Connected Components/047 Kosaraju implementation I - the Graph class-subtitle-en.srt | 8.61KB 06 Strongly Connected Components/047 Kosaraju implementation I - the Graph class.mp4 | 17.52MB 06 Strongly Connected Components/048 Kosaraju implementation II-subtitle-en.srt | 7.42KB 06 Strongly Connected Components/048 Kosaraju implementation II.mp4 | 14.54MB 06 Strongly Connected Components/049 Kosaraju algorithm implementation III - test-subtitle-en.srt | 3.19KB 06 Strongly Connected Components/049 Kosaraju algorithm implementation III - test.mp4 | 6.95MB 06 Strongly Connected Components/050 Tarjan algorithm introduction-subtitle-en.srt | 7.67KB 06 Strongly Connected Components/050 Tarjan algorithm introduction.mp4 | 13.06MB 06 Strongly Connected Components/051 Tarjan implementation I-subtitle-en.srt | 6.32KB 06 Strongly Connected Components/051 Tarjan implementation I.mp4 | 13.73MB 06 Strongly Connected Components/052 Tarjan implementation II - test-subtitle-en.srt | 2.96KB 06 Strongly Connected Components/052 Tarjan implementation II - test.mp4 | 6.41MB 06 Strongly Connected Components/053 Applications of strongly connected components-subtitle-en.srt | 9.85KB 06 Strongly Connected Components/053 Applications of strongly connected components.mp4 | 15.56MB 07 Maximum Flow Problem/054 Maximum flow introduction - basics-subtitle-en.srt | 8.98KB 07 Maximum Flow Problem/054 Maximum flow introduction - basics.mp4 | 15.02MB 07 Maximum Flow Problem/055 Maximum flow introduction - properties-subtitle-en.srt | 11.79KB 07 Maximum Flow Problem/055 Maximum flow introduction - properties.mp4 | 20.88MB 07 Maximum Flow Problem/056 Maximum flow introduction - cuts-subtitle-en.srt | 6.46KB 07 Maximum Flow Problem/056 Maximum flow introduction - cuts.mp4 | 12.18MB 07 Maximum Flow Problem/057 Maximum flow introduction - residual networks-subtitle-en.srt | 8.58KB 07 Maximum Flow Problem/057 Maximum flow introduction - residual networks.mp4 | 15.36MB 07 Maximum Flow Problem/058 Maximum flow introduction - Ford-Fulkerson algorithm-subtitle-en.srt | 5.97KB 07 Maximum Flow Problem/058 Maximum flow introduction - Ford-Fulkerson algorithm.mp4 | 10.86MB 07 Maximum Flow Problem/059 Maximum flow introduction - example-subtitle-en.srt | 11.36KB 07 Maximum Flow Problem/059 Maximum flow introduction - example.mp4 | 19.18MB 07 Maximum Flow Problem/060 Maximum flow introduction - applications-subtitle-en.srt | 4.19KB 07 Maximum Flow Problem/060 Maximum flow introduction - applications.mp4 | 7.14MB 07 Maximum Flow Problem/061 Maximum flow implementation I - Edge_ Vertex-subtitle-en.srt | 13.84KB 07 Maximum Flow Problem/061 Maximum flow implementation I - Edge_ Vertex.mp4 | 24.15MB 07 Maximum Flow Problem/062 Maximum flow implementation II - FlowNetwork class-subtitle-en.srt | 5.91KB 07 Maximum Flow Problem/062 Maximum flow implementation II - FlowNetwork class.mp4 | 11.06MB 07 Maximum Flow Problem/063 Maximum flow implementation III - Ford-Fulkerson algorithm-subtitle-en.srt | 9.74KB 07 Maximum Flow Problem/063 Maximum flow implementation III - Ford-Fulkerson algorithm.mp4 | 16.77MB 07 Maximum Flow Problem/064 Maximum flow implementation IV - augmentation-subtitle-en.srt | 8.11KB 07 Maximum Flow Problem/064 Maximum flow implementation IV - augmentation.mp4 | 14.67MB 07 Maximum Flow Problem/065 Maximum flow implementation V - testing-subtitle-en.srt | 3.86KB 07 Maximum Flow Problem/065 Maximum flow implementation V - testing.mp4 | 6.80MB 07 Maximum Flow Problem/066 Bipartite matching problem introduction-subtitle-en.srt | 5.06KB 07 Maximum Flow Problem/066 Bipartite matching problem introduction.mp4 | 8.49MB 07 Maximum Flow Problem/067 Bipartite matching implementation-subtitle-en.srt | 2.91KB 07 Maximum Flow Problem/067 Bipartite matching implementation.mp4 | 6.07MB 08 Travelling Salesman Problem (TSP)/068 Travelling salesman problem introduction-subtitle-en.srt | 14.59KB 08 Travelling Salesman Problem (TSP)/068 Travelling salesman problem introduction.mp4 | 24.72MB 08 Travelling Salesman Problem (TSP)/069 TSP implementation with simulated annealing I - city-subtitle-en.srt | 11.96KB 08 Travelling Salesman Problem (TSP)/069 TSP implementation with simulated annealing I - city.mp4 | 21.94MB 08 Travelling Salesman Problem (TSP)/069 TSP.zip | 3.13KB 08 Travelling Salesman Problem (TSP)/070 TSP implementation with simulated annealing II - tour-subtitle-en.srt | 15.75KB 08 Travelling Salesman Problem (TSP)/070 TSP implementation with simulated annealing II - tour.mp4 | 29.87MB 08 Travelling Salesman Problem (TSP)/071 TSP implementation with simulated annealing III - algorithm-subtitle-en.srt | 12.31KB 08 Travelling Salesman Problem (TSP)/071 TSP implementation with simulated annealing III - algorithm.mp4 | 23.01MB 08 Travelling Salesman Problem (TSP)/072 TSP implementation with simulated annealing IV - testing-subtitle-en.srt | 6.05KB 08 Travelling Salesman Problem (TSP)/072 TSP implementation with simulated annealing IV - testing.mp4 | 9.25MB 08 Travelling Salesman Problem (TSP)/073 Tabu search introduction-subtitle-en.srt | 11.69KB 08 Travelling Salesman Problem (TSP)/073 Tabu search introduction.mp4 | 21.21MB 08 Travelling Salesman Problem (TSP)/074 Tabu search introduction II-subtitle-en.srt | 5.95KB 08 Travelling Salesman Problem (TSP)/074 Tabu search introduction II.mp4 | 10.39MB 09 Euler cycle - Chinese Postman Problem/075 Euler's cycles introduction-subtitle-en.srt | 12.92KB 09 Euler cycle - Chinese Postman Problem/075 Euler's cycles introduction.mp4 | 28.93MB 10 Source Code & Slides/076 GraphalgorithmsCode.zip | 99.08KB 10 Source Code & Slides/076 Source code.html | 1.16KB 10 Source Code & Slides/077 AdvancedAlgosSlides.zip | 11.07MB 10 Source Code & Slides/077 Slides.html | 1.15KB 10 Source Code & Slides/078 DISCOUNT FOR OTHER COURSES!.html | 1.26KB 10 Source Code & Slides/078 FINAL-COUPONS.txt | 3.54KB