| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/01_welcome/01_welcome_instructions.html |
4 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/02_graph-basics/01_graph-basics.en.srt |
7 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/02_graph-basics/01_graph-basics.en.txt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/02_graph-basics/01_graph-basics.mp4 |
8.5 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/02_graph-basics/01_graph-basics.zh-CN.srt |
6 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/02_graph-basics/01_graph-basics.zh-CN.txt |
4 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/02_graph-basics/02_representing-graphs.en.srt |
15 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/02_graph-basics/02_representing-graphs.en.txt |
10 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/02_graph-basics/02_representing-graphs.mp4 |
18.5 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/02_graph-basics/03_slides-and-external-references_09_graph_decomposition_1_basics.pdf |
2.7 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/02_graph-basics/03_slides-and-external-references_09_graph_decomposition_2_representations.pdf |
208 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/02_graph-basics/03_slides-and-external-references_instructions.html |
2 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/03_exploring-undirected-graphs/01_exploring-graphs.en.srt |
23 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/03_exploring-undirected-graphs/01_exploring-graphs.en.txt |
14 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/03_exploring-undirected-graphs/01_exploring-graphs.mp4 |
25.4 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/03_exploring-undirected-graphs/02_connectivity.en.srt |
9 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/03_exploring-undirected-graphs/02_connectivity.en.txt |
6 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/03_exploring-undirected-graphs/02_connectivity.mp4 |
9.6 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/03_exploring-undirected-graphs/03_previsit-and-postvisit-orderings.en.srt |
12 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/03_exploring-undirected-graphs/03_previsit-and-postvisit-orderings.en.txt |
7 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/03_exploring-undirected-graphs/03_previsit-and-postvisit-orderings.mp4 |
12.2 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/03_exploring-undirected-graphs/04_slides-and-external-references_09_graph_decomposition_3_explore.pdf |
566 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/03_exploring-undirected-graphs/04_slides-and-external-references_09_graph_decomposition_4_connectivity.pdf |
395 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/03_exploring-undirected-graphs/04_slides-and-external-references_09_graph_decomposition_5_pre-and-post-orders.pdf |
427 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/03_exploring-undirected-graphs/04_slides-and-external-references_DFS.html |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/03_exploring-undirected-graphs/04_slides-and-external-references_instructions.html |
2 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/04_programming-assignment/01_programming-assignment-1-decomposition-of-graphs_09_graph_decomposition_problems_1.pdf |
281 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/04_programming-assignment/01_programming-assignment-1-decomposition-of-graphs_09_graph_decomposition_starter_files_1.zip |
281 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/01_decomposition-of-graphs-1/04_programming-assignment/01_programming-assignment-1-decomposition-of-graphs_instructions.html |
2 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/01_directed-graphs/01_directed-acyclic-graphs.en.srt |
12 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/01_directed-graphs/01_directed-acyclic-graphs.en.txt |
8 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/01_directed-graphs/01_directed-acyclic-graphs.mp4 |
13.1 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/01_directed-graphs/02_topological-sort.en.srt |
14 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/01_directed-graphs/02_topological-sort.en.txt |
9 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/01_directed-graphs/02_topological-sort.mp4 |
16.1 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/01_directed-graphs/03_strongly-connected-components.en.srt |
12 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/01_directed-graphs/03_strongly-connected-components.en.txt |
8 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/01_directed-graphs/03_strongly-connected-components.mp4 |
12.6 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/01_directed-graphs/04_computing-strongly-connected-components.en.srt |
16 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/01_directed-graphs/04_computing-strongly-connected-components.en.txt |
10 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/01_directed-graphs/04_computing-strongly-connected-components.mp4 |
18.9 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_09_graph_decomposition_6_dags.pdf |
234 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_09_graph_decomposition_7_topological-sort.pdf |
658 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_09_graph_decomposition_8_strongly-connected-components.pdf |
207 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_09_graph_decomposition_9_computing-sccs.pdf |
650 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_ConnectedComponent.html |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_TopoSortDFS.html |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_TopoSortIndegree.html |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_instructions.html |
2 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/02_programming-assignment/01_programming-assignment-2-decomposition-of-graphs_09_graph_decomposition_problems_2.pdf |
479 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/02_programming-assignment/01_programming-assignment-2-decomposition-of-graphs_09_graph_decomposition_starter_files_2.zip |
4 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/02_decomposition-of-graphs-2/02_programming-assignment/01_programming-assignment-2-decomposition-of-graphs_instructions.html |
1 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/01_most-direct-route.en.srt |
12 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/01_most-direct-route.en.txt |
8 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/01_most-direct-route.mp4 |
17.8 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/02_breadth-first-search.en.srt |
10 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/02_breadth-first-search.en.txt |
6 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/02_breadth-first-search.mp4 |
16.4 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/03_breadth-first-search-continued.en.srt |
9 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/03_breadth-first-search-continued.en.txt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/03_breadth-first-search-continued.mp4 |
12.8 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/04_implementation-and-analysis.en.srt |
12 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/04_implementation-and-analysis.en.txt |
8 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/04_implementation-and-analysis.mp4 |
21.5 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/04_implementation-and-analysis.ne.srt |
12 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/04_implementation-and-analysis.ne.txt |
8 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/05_proof-of-correctness.en.srt |
9 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/05_proof-of-correctness.en.txt |
6 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/05_proof-of-correctness.mp4 |
14.6 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/06_proof-of-correctness-continued.en.srt |
7 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/06_proof-of-correctness-continued.en.txt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/06_proof-of-correctness-continued.mp4 |
12.5 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/07_shortest-path-tree.en.srt |
8 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/07_shortest-path-tree.en.txt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/07_shortest-path-tree.mp4 |
13.6 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.de.srt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.de.txt |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.en.srt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.en.txt |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.et.srt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.et.txt |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ja.srt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ja.txt |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.kk.srt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.kk.txt |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.lt.srt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.lt.txt |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.mn.srt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.mn.txt |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.mp4 |
7.9 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ne.srt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ne.txt |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ro.srt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ro.txt |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sk.srt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sk.txt |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sq.srt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sq.txt |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sr.srt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sr.txt |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sv.srt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sv.txt |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ta.srt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ta.txt |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.te.srt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.te.txt |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.th.srt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.th.txt |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.tr.srt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.tr.txt |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/09_slides-and-external-references_10_shortest_paths_in_graphs_1_bfs.pdf |
2.1 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/09_slides-and-external-references_BFS.html |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/01_most-direct-route/09_slides-and-external-references_instructions.html |
2 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/02_programming-assignment/01_programming-assignment-3-paths-in-graphs_10_paths_in_graphs_problems_1.pdf |
363 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/02_programming-assignment/01_programming-assignment-3-paths-in-graphs_10_paths_in_graphs_starter_files_1.zip |
2 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/03_paths-in-graphs-1/02_programming-assignment/01_programming-assignment-3-paths-in-graphs_instructions.html |
1 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/01_fastest-route.en.srt |
9 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/01_fastest-route.en.txt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/01_fastest-route.mp4 |
14.9 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/02_naive-algorithm.en.srt |
13 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/02_naive-algorithm.en.txt |
8 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/02_naive-algorithm.mp4 |
23.9 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/02_naive-algorithm.sq.srt |
13 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/02_naive-algorithm.sq.txt |
8 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/02_naive-algorithm.te.srt |
13 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/02_naive-algorithm.te.txt |
8 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/03_dijkstras-algorithm-intuition-and-example.en.srt |
10 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/03_dijkstras-algorithm-intuition-and-example.en.txt |
6 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/03_dijkstras-algorithm-intuition-and-example.mp4 |
15.7 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/04_dijkstras-algorithm-implementation.en.srt |
4 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/04_dijkstras-algorithm-implementation.en.txt |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/04_dijkstras-algorithm-implementation.mp4 |
8.1 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/05_dijkstras-algorithm-proof-of-correctness.en.srt |
6 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/05_dijkstras-algorithm-proof-of-correctness.en.txt |
4 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/05_dijkstras-algorithm-proof-of-correctness.mp4 |
10.8 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/06_dijkstras-algorithm-running-time.en.srt |
9 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/06_dijkstras-algorithm-running-time.en.txt |
6 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/06_dijkstras-algorithm-running-time.mp4 |
15.9 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/07_slides-and-external-references_10_shortest_paths_in_graphs_2_dijkstra.pdf |
1.1 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/07_slides-and-external-references_Dijkstra.html |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/01_fastest-route/07_slides-and-external-references_instructions.html |
1 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/02_currency-exchange/01_currency-exchange.en.srt |
8 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/02_currency-exchange/01_currency-exchange.en.txt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/02_currency-exchange/01_currency-exchange.mp4 |
12.8 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/02_currency-exchange/02_currency-exchange-reduction-to-shortest-paths.en.srt |
10 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/02_currency-exchange/02_currency-exchange-reduction-to-shortest-paths.en.txt |
6 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/02_currency-exchange/02_currency-exchange-reduction-to-shortest-paths.mp4 |
16.2 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/02_currency-exchange/03_bellman-ford-algorithm.en.srt |
8 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/02_currency-exchange/03_bellman-ford-algorithm.en.txt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/02_currency-exchange/03_bellman-ford-algorithm.mp4 |
11.5 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/02_currency-exchange/03_bellman-ford-algorithm.ru.srt |
12 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/02_currency-exchange/03_bellman-ford-algorithm.ru.txt |
9 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/02_currency-exchange/04_bellman-ford-algorithm-proof-of-correctness.en.srt |
7 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/02_currency-exchange/04_bellman-ford-algorithm-proof-of-correctness.en.txt |
4 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/02_currency-exchange/04_bellman-ford-algorithm-proof-of-correctness.mp4 |
13 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/02_currency-exchange/05_negative-cycles.en.srt |
9 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/02_currency-exchange/05_negative-cycles.en.txt |
6 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/02_currency-exchange/05_negative-cycles.mp4 |
15.4 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/02_currency-exchange/06_infinite-arbitrage.en.srt |
13 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/02_currency-exchange/06_infinite-arbitrage.en.txt |
8 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/02_currency-exchange/06_infinite-arbitrage.mp4 |
21.9 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/02_currency-exchange/07_slides-and-external-references_10_shortest_paths_in_graphs_3_bellman_ford.pdf |
549 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/02_currency-exchange/07_slides-and-external-references_instructions.html |
1 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/03_programming-assignment/01_programming-assignment-4-paths-in-graphs_10_paths_in_graphs_problems_2.pdf |
356 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/03_programming-assignment/01_programming-assignment-4-paths-in-graphs_10_paths_in_graphs_starter_files_2.zip |
4 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/04_paths-in-graphs-2/03_programming-assignment/01_programming-assignment-4-paths-in-graphs_instructions.html |
1 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/05_minimum-spanning-trees/01_minimum-spanning-trees/01_building-a-network.en.srt |
12 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/05_minimum-spanning-trees/01_minimum-spanning-trees/01_building-a-network.en.txt |
7 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/05_minimum-spanning-trees/01_minimum-spanning-trees/01_building-a-network.mp4 |
15.7 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/05_minimum-spanning-trees/01_minimum-spanning-trees/02_greedy-algorithms.en.srt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/05_minimum-spanning-trees/01_minimum-spanning-trees/02_greedy-algorithms.en.txt |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/05_minimum-spanning-trees/01_minimum-spanning-trees/02_greedy-algorithms.mp4 |
8.8 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/05_minimum-spanning-trees/01_minimum-spanning-trees/03_cut-property.en.srt |
10 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/05_minimum-spanning-trees/01_minimum-spanning-trees/03_cut-property.en.txt |
6 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/05_minimum-spanning-trees/01_minimum-spanning-trees/03_cut-property.mp4 |
22.6 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/05_minimum-spanning-trees/01_minimum-spanning-trees/04_kruskals-algorithm.en.srt |
18 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/05_minimum-spanning-trees/01_minimum-spanning-trees/04_kruskals-algorithm.en.txt |
11 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/05_minimum-spanning-trees/01_minimum-spanning-trees/04_kruskals-algorithm.mp4 |
27.5 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/05_minimum-spanning-trees/01_minimum-spanning-trees/05_prims-algorithm.en.srt |
15 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/05_minimum-spanning-trees/01_minimum-spanning-trees/05_prims-algorithm.en.txt |
9 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/05_minimum-spanning-trees/01_minimum-spanning-trees/05_prims-algorithm.mp4 |
24.1 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/05_minimum-spanning-trees/01_minimum-spanning-trees/06_slides-and-external-references_11_1_minimum_spanning_trees.pdf |
493 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/05_minimum-spanning-trees/01_minimum-spanning-trees/06_slides-and-external-references_Kruskal.html |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/05_minimum-spanning-trees/01_minimum-spanning-trees/06_slides-and-external-references_instructions.html |
1 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/05_minimum-spanning-trees/02_programming-assignment/01_programming-assignment-5-minimum-spanning-trees_11_spanning_trees_starter_files.zip |
2 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/05_minimum-spanning-trees/02_programming-assignment/01_programming-assignment-5-minimum-spanning-trees_instructions.html |
1 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/01_programming-project-introduction.en.srt |
2 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/01_programming-project-introduction.en.txt |
1 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/01_programming-project-introduction.mp4 |
3 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/02_bidirectional-search.en.srt |
13 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/02_bidirectional-search.en.txt |
8 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/02_bidirectional-search.mp4 |
19.6 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/03_six-handshakes.en.srt |
9 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/03_six-handshakes.en.txt |
6 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/03_six-handshakes.mp4 |
15 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/04_bidirectional-dijkstra.en.srt |
7 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/04_bidirectional-dijkstra.en.txt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/04_bidirectional-dijkstra.mp4 |
11.9 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/05_finding-shortest-path-after-meeting-in-the-middle.en.srt |
10 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/05_finding-shortest-path-after-meeting-in-the-middle.en.txt |
7 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/05_finding-shortest-path-after-meeting-in-the-middle.mp4 |
13.3 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/06_computing-the-distance.en.srt |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/06_computing-the-distance.en.txt |
2 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/06_computing-the-distance.mp4 |
5.4 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/07_slides-and-external-references_19_advanced_shortest_paths_1_bidirectional_dijkstra.pdf |
1.8 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/07_slides-and-external-references_instructions.html |
1 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/01_a-algorithm.en.srt |
14 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/01_a-algorithm.en.txt |
9 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/01_a-algorithm.mp4 |
22.1 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/02_performance-of-a.en.srt |
3 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/02_performance-of-a.en.txt |
2 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/02_performance-of-a.mp4 |
4.8 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/03_bidirectional-a.en.srt |
8 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/03_bidirectional-a.en.txt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/03_bidirectional-a.mp4 |
14.6 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/04_potential-functions-and-lower-bounds.en.srt |
8 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/04_potential-functions-and-lower-bounds.en.txt |
5 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/04_potential-functions-and-lower-bounds.mp4 |
13.8 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/05_landmarks-optional.en.srt |
12 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/05_landmarks-optional.en.txt |
8 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/05_landmarks-optional.mp4 |
25.3 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/06_slides-and-external-references_19_advanced_shortest_paths_2_A_star.pdf |
760 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/06_slides-and-external-references_instructions.html |
1 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/01_highway-hierarchies-and-node-importance.en.srt |
10 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/01_highway-hierarchies-and-node-importance.en.txt |
7 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/01_highway-hierarchies-and-node-importance.mp4 |
15.2 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/02_preprocessing.en.srt |
10 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/02_preprocessing.en.txt |
6 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/02_preprocessing.mp4 |
16.3 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/03_witness-search.en.srt |
12 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/03_witness-search.en.txt |
8 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/03_witness-search.mp4 |
21.4 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/04_query.en.srt |
11 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/04_query.en.txt |
7 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/04_query.mp4 |
17.6 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/05_proof-of-correctness.en.srt |
11 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/05_proof-of-correctness.en.txt |
7 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/05_proof-of-correctness.mp4 |
21 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/06_node-ordering.en.srt |
21 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/06_node-ordering.en.txt |
13 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/06_node-ordering.mp4 |
30.3 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/07_slides-and-external-refernces_19_advanced_shortest_paths_3_contraction_hierarchies.pdf |
1.6 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/07_slides-and-external-refernces_HL-TR.pdf |
1.6 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/07_slides-and-external-refernces_contract.pdf |
359 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/07_slides-and-external-refernces_download.shtml |
19 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/07_slides-and-external-refernces_instructions.html |
2 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/07_slides-and-external-refernces_midas-werneck.pdf |
6 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/04_programming-project/01_advanced-shortest-paths_Advanced_Shortest_Paths.pdf |
1.8 MB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/04_programming-project/01_advanced-shortest-paths_Advanced_Shortest_Paths.zip |
35 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/06_advanced-shortest-paths-project-optional/04_programming-project/01_advanced-shortest-paths_instructions.html |
2 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/07_Resources/01_partner-specialization/01__resources.html |
1 KB |
| [CourseClub.NET] Coursera - Algorithms on Graphs/[CourseClub.NET].url |
123 B |
| [CourseClub.NET] Coursera - Algorithms on Graphs/[DesireCourse.Com].url |
51 B |
Magnet link
