[CourseClub.NET] Coursera - Algorithms on Graphs
大小
828.63 MB
文件数
253
Info Hash:
656CD7D02FE651F46A14BEE2590D2454171A250D
收录时间
2025-12-21 12:40:53
更新时间
2025-12-21 13:05:05
文件列表 (253)
01_decomposition-of-graphs-1/01_welcome/01_welcome_instructions.html
3.96 KB
01_decomposition-of-graphs-1/02_graph-basics/01_graph-basics.en.srt
7.21 KB
01_decomposition-of-graphs-1/02_graph-basics/01_graph-basics.en.txt
4.6 KB
01_decomposition-of-graphs-1/02_graph-basics/01_graph-basics.mp4
8.55 MB
01_decomposition-of-graphs-1/02_graph-basics/01_graph-basics.zh-CN.srt
6.26 KB
01_decomposition-of-graphs-1/02_graph-basics/01_graph-basics.zh-CN.txt
3.65 KB
01_decomposition-of-graphs-1/02_graph-basics/02_representing-graphs.en.srt
15.08 KB
01_decomposition-of-graphs-1/02_graph-basics/02_representing-graphs.en.txt
9.55 KB
01_decomposition-of-graphs-1/02_graph-basics/02_representing-graphs.mp4
18.51 MB
01_decomposition-of-graphs-1/02_graph-basics/03_slides-and-external-references_09_graph_decomposition_1_basics.pdf
2.73 MB
01_decomposition-of-graphs-1/02_graph-basics/03_slides-and-external-references_09_graph_decomposition_2_representations.pdf
207.86 KB
01_decomposition-of-graphs-1/02_graph-basics/03_slides-and-external-references_instructions.html
1.73 KB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/01_exploring-graphs.en.srt
23.08 KB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/01_exploring-graphs.en.txt
14.41 KB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/01_exploring-graphs.mp4
25.4 MB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/02_connectivity.en.srt
9.14 KB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/02_connectivity.en.txt
5.73 KB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/02_connectivity.mp4
9.6 MB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/03_previsit-and-postvisit-orderings.en.srt
11.96 KB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/03_previsit-and-postvisit-orderings.en.txt
7.42 KB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/03_previsit-and-postvisit-orderings.mp4
12.24 MB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/04_slides-and-external-references_09_graph_decomposition_3_explore.pdf
565.6 KB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/04_slides-and-external-references_09_graph_decomposition_4_connectivity.pdf
394.88 KB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/04_slides-and-external-references_09_graph_decomposition_5_pre-and-post-orders.pdf
427.06 KB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/04_slides-and-external-references_DFS.html
2.79 KB
01_decomposition-of-graphs-1/03_exploring-undirected-graphs/04_slides-and-external-references_instructions.html
1.72 KB
01_decomposition-of-graphs-1/04_programming-assignment/01_programming-assignment-1-decomposition-of-graphs_09_graph_decomposition_problems_1.pdf
280.66 KB
01_decomposition-of-graphs-1/04_programming-assignment/01_programming-assignment-1-decomposition-of-graphs_09_graph_decomposition_starter_files_1.zip
280.92 KB
01_decomposition-of-graphs-1/04_programming-assignment/01_programming-assignment-1-decomposition-of-graphs_instructions.html
1.72 KB
02_decomposition-of-graphs-2/01_directed-graphs/01_directed-acyclic-graphs.en.srt
12.26 KB
02_decomposition-of-graphs-2/01_directed-graphs/01_directed-acyclic-graphs.en.txt
7.68 KB
02_decomposition-of-graphs-2/01_directed-graphs/01_directed-acyclic-graphs.mp4
13.13 MB
02_decomposition-of-graphs-2/01_directed-graphs/02_topological-sort.en.srt
13.9 KB
02_decomposition-of-graphs-2/01_directed-graphs/02_topological-sort.en.txt
8.64 KB
02_decomposition-of-graphs-2/01_directed-graphs/02_topological-sort.mp4
16.14 MB
02_decomposition-of-graphs-2/01_directed-graphs/03_strongly-connected-components.en.srt
12.04 KB
02_decomposition-of-graphs-2/01_directed-graphs/03_strongly-connected-components.en.txt
7.5 KB
02_decomposition-of-graphs-2/01_directed-graphs/03_strongly-connected-components.mp4
12.56 MB
02_decomposition-of-graphs-2/01_directed-graphs/04_computing-strongly-connected-components.en.srt
16.24 KB
02_decomposition-of-graphs-2/01_directed-graphs/04_computing-strongly-connected-components.en.txt
10.06 KB
02_decomposition-of-graphs-2/01_directed-graphs/04_computing-strongly-connected-components.mp4
18.86 MB
02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_09_graph_decomposition_6_dags.pdf
234.23 KB
02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_09_graph_decomposition_7_topological-sort.pdf
657.84 KB
02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_09_graph_decomposition_8_strongly-connected-components.pdf
206.88 KB
02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_09_graph_decomposition_9_computing-sccs.pdf
650.49 KB
02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_ConnectedComponent.html
2.81 KB
02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_TopoSortDFS.html
2.8 KB
02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_TopoSortIndegree.html
2.82 KB
02_decomposition-of-graphs-2/01_directed-graphs/05_slides-and-external-references_instructions.html
2.31 KB
02_decomposition-of-graphs-2/02_programming-assignment/01_programming-assignment-2-decomposition-of-graphs_09_graph_decomposition_problems_2.pdf
478.59 KB
02_decomposition-of-graphs-2/02_programming-assignment/01_programming-assignment-2-decomposition-of-graphs_09_graph_decomposition_starter_files_2.zip
4.07 KB
02_decomposition-of-graphs-2/02_programming-assignment/01_programming-assignment-2-decomposition-of-graphs_instructions.html
1.33 KB
03_paths-in-graphs-1/01_most-direct-route/01_most-direct-route.en.srt
12.17 KB
03_paths-in-graphs-1/01_most-direct-route/01_most-direct-route.en.txt
7.69 KB
03_paths-in-graphs-1/01_most-direct-route/01_most-direct-route.mp4
17.8 MB
03_paths-in-graphs-1/01_most-direct-route/02_breadth-first-search.en.srt
10.31 KB
03_paths-in-graphs-1/01_most-direct-route/02_breadth-first-search.en.txt
6.49 KB
03_paths-in-graphs-1/01_most-direct-route/02_breadth-first-search.mp4
16.37 MB
03_paths-in-graphs-1/01_most-direct-route/03_breadth-first-search-continued.en.srt
8.54 KB
03_paths-in-graphs-1/01_most-direct-route/03_breadth-first-search-continued.en.txt
5.3 KB
03_paths-in-graphs-1/01_most-direct-route/03_breadth-first-search-continued.mp4
12.82 MB
03_paths-in-graphs-1/01_most-direct-route/04_implementation-and-analysis.en.srt
11.89 KB
03_paths-in-graphs-1/01_most-direct-route/04_implementation-and-analysis.en.txt
7.52 KB
03_paths-in-graphs-1/01_most-direct-route/04_implementation-and-analysis.mp4
21.55 MB
03_paths-in-graphs-1/01_most-direct-route/04_implementation-and-analysis.ne.srt
11.89 KB
03_paths-in-graphs-1/01_most-direct-route/04_implementation-and-analysis.ne.txt
7.52 KB
03_paths-in-graphs-1/01_most-direct-route/05_proof-of-correctness.en.srt
9.15 KB
03_paths-in-graphs-1/01_most-direct-route/05_proof-of-correctness.en.txt
5.6 KB
03_paths-in-graphs-1/01_most-direct-route/05_proof-of-correctness.mp4
14.65 MB
03_paths-in-graphs-1/01_most-direct-route/06_proof-of-correctness-continued.en.srt
7.24 KB
03_paths-in-graphs-1/01_most-direct-route/06_proof-of-correctness-continued.en.txt
4.56 KB
03_paths-in-graphs-1/01_most-direct-route/06_proof-of-correctness-continued.mp4
12.46 MB
03_paths-in-graphs-1/01_most-direct-route/07_shortest-path-tree.en.srt
7.79 KB
03_paths-in-graphs-1/01_most-direct-route/07_shortest-path-tree.en.txt
4.91 KB
03_paths-in-graphs-1/01_most-direct-route/07_shortest-path-tree.mp4
13.58 MB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.de.srt
4.56 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.de.txt
2.81 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.en.srt
4.56 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.en.txt
2.81 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.et.srt
4.56 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.et.txt
2.81 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ja.srt
4.57 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ja.txt
2.82 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.kk.srt
4.56 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.kk.txt
2.81 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.lt.srt
4.55 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.lt.txt
2.8 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.mn.srt
4.83 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.mn.txt
3.08 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.mp4
7.94 MB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ne.srt
4.56 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ne.txt
2.81 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ro.srt
4.55 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ro.txt
2.8 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sk.srt
4.55 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sk.txt
2.8 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sq.srt
4.56 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sq.txt
2.81 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sr.srt
4.55 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sr.txt
2.8 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sv.srt
4.56 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.sv.txt
2.81 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ta.srt
4.72 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.ta.txt
2.97 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.te.srt
4.56 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.te.txt
2.81 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.th.srt
4.6 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.th.txt
2.85 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.tr.srt
4.56 KB
03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.tr.txt
2.81 KB
03_paths-in-graphs-1/01_most-direct-route/09_slides-and-external-references_10_shortest_paths_in_graphs_1_bfs.pdf
2.12 MB
03_paths-in-graphs-1/01_most-direct-route/09_slides-and-external-references_BFS.html
2.78 KB
03_paths-in-graphs-1/01_most-direct-route/09_slides-and-external-references_instructions.html
1.87 KB
03_paths-in-graphs-1/02_programming-assignment/01_programming-assignment-3-paths-in-graphs_10_paths_in_graphs_problems_1.pdf
363.3 KB
03_paths-in-graphs-1/02_programming-assignment/01_programming-assignment-3-paths-in-graphs_10_paths_in_graphs_starter_files_1.zip
2.5 KB
03_paths-in-graphs-1/02_programming-assignment/01_programming-assignment-3-paths-in-graphs_instructions.html
1.38 KB
04_paths-in-graphs-2/01_fastest-route/01_fastest-route.en.srt
8.57 KB
04_paths-in-graphs-2/01_fastest-route/01_fastest-route.en.txt
5.39 KB
04_paths-in-graphs-2/01_fastest-route/01_fastest-route.mp4
14.95 MB
04_paths-in-graphs-2/01_fastest-route/02_naive-algorithm.en.srt
13.3 KB
04_paths-in-graphs-2/01_fastest-route/02_naive-algorithm.en.txt
8.28 KB
04_paths-in-graphs-2/01_fastest-route/02_naive-algorithm.mp4
23.92 MB
04_paths-in-graphs-2/01_fastest-route/02_naive-algorithm.sq.srt
13.3 KB
04_paths-in-graphs-2/01_fastest-route/02_naive-algorithm.sq.txt
8.28 KB
04_paths-in-graphs-2/01_fastest-route/02_naive-algorithm.te.srt
13.3 KB
04_paths-in-graphs-2/01_fastest-route/02_naive-algorithm.te.txt
8.28 KB
04_paths-in-graphs-2/01_fastest-route/03_dijkstras-algorithm-intuition-and-example.en.srt
9.71 KB
04_paths-in-graphs-2/01_fastest-route/03_dijkstras-algorithm-intuition-and-example.en.txt
6.02 KB
04_paths-in-graphs-2/01_fastest-route/03_dijkstras-algorithm-intuition-and-example.mp4
15.67 MB
04_paths-in-graphs-2/01_fastest-route/04_dijkstras-algorithm-implementation.en.srt
4.41 KB
04_paths-in-graphs-2/01_fastest-route/04_dijkstras-algorithm-implementation.en.txt
2.76 KB
04_paths-in-graphs-2/01_fastest-route/04_dijkstras-algorithm-implementation.mp4
8.12 MB
04_paths-in-graphs-2/01_fastest-route/05_dijkstras-algorithm-proof-of-correctness.en.srt
6.25 KB
04_paths-in-graphs-2/01_fastest-route/05_dijkstras-algorithm-proof-of-correctness.en.txt
3.9 KB
04_paths-in-graphs-2/01_fastest-route/05_dijkstras-algorithm-proof-of-correctness.mp4
10.8 MB
04_paths-in-graphs-2/01_fastest-route/06_dijkstras-algorithm-running-time.en.srt
9.16 KB
04_paths-in-graphs-2/01_fastest-route/06_dijkstras-algorithm-running-time.en.txt
5.91 KB
04_paths-in-graphs-2/01_fastest-route/06_dijkstras-algorithm-running-time.mp4
15.94 MB
04_paths-in-graphs-2/01_fastest-route/07_slides-and-external-references_10_shortest_paths_in_graphs_2_dijkstra.pdf
1.09 MB
04_paths-in-graphs-2/01_fastest-route/07_slides-and-external-references_Dijkstra.html
2.79 KB
04_paths-in-graphs-2/01_fastest-route/07_slides-and-external-references_instructions.html
1.48 KB
04_paths-in-graphs-2/02_currency-exchange/01_currency-exchange.en.srt
7.68 KB
04_paths-in-graphs-2/02_currency-exchange/01_currency-exchange.en.txt
4.8 KB
04_paths-in-graphs-2/02_currency-exchange/01_currency-exchange.mp4
12.78 MB
04_paths-in-graphs-2/02_currency-exchange/02_currency-exchange-reduction-to-shortest-paths.en.srt
10.12 KB
04_paths-in-graphs-2/02_currency-exchange/02_currency-exchange-reduction-to-shortest-paths.en.txt
6.43 KB
04_paths-in-graphs-2/02_currency-exchange/02_currency-exchange-reduction-to-shortest-paths.mp4
16.15 MB
04_paths-in-graphs-2/02_currency-exchange/03_bellman-ford-algorithm.en.srt
7.66 KB
04_paths-in-graphs-2/02_currency-exchange/03_bellman-ford-algorithm.en.txt
4.65 KB
04_paths-in-graphs-2/02_currency-exchange/03_bellman-ford-algorithm.mp4
11.48 MB
04_paths-in-graphs-2/02_currency-exchange/03_bellman-ford-algorithm.ru.srt
11.71 KB
04_paths-in-graphs-2/02_currency-exchange/03_bellman-ford-algorithm.ru.txt
8.69 KB
04_paths-in-graphs-2/02_currency-exchange/04_bellman-ford-algorithm-proof-of-correctness.en.srt
6.93 KB
04_paths-in-graphs-2/02_currency-exchange/04_bellman-ford-algorithm-proof-of-correctness.en.txt
4.38 KB
04_paths-in-graphs-2/02_currency-exchange/04_bellman-ford-algorithm-proof-of-correctness.mp4
13.03 MB
04_paths-in-graphs-2/02_currency-exchange/05_negative-cycles.en.srt
9.45 KB
04_paths-in-graphs-2/02_currency-exchange/05_negative-cycles.en.txt
5.97 KB
04_paths-in-graphs-2/02_currency-exchange/05_negative-cycles.mp4
15.45 MB
04_paths-in-graphs-2/02_currency-exchange/06_infinite-arbitrage.en.srt
13.32 KB
04_paths-in-graphs-2/02_currency-exchange/06_infinite-arbitrage.en.txt
8.44 KB
04_paths-in-graphs-2/02_currency-exchange/06_infinite-arbitrage.mp4
21.85 MB
04_paths-in-graphs-2/02_currency-exchange/07_slides-and-external-references_10_shortest_paths_in_graphs_3_bellman_ford.pdf
548.67 KB
04_paths-in-graphs-2/02_currency-exchange/07_slides-and-external-references_instructions.html
1.31 KB
04_paths-in-graphs-2/03_programming-assignment/01_programming-assignment-4-paths-in-graphs_10_paths_in_graphs_problems_2.pdf
355.56 KB
04_paths-in-graphs-2/03_programming-assignment/01_programming-assignment-4-paths-in-graphs_10_paths_in_graphs_starter_files_2.zip
4.48 KB
04_paths-in-graphs-2/03_programming-assignment/01_programming-assignment-4-paths-in-graphs_instructions.html
1.32 KB
05_minimum-spanning-trees/01_minimum-spanning-trees/01_building-a-network.en.srt
11.94 KB
05_minimum-spanning-trees/01_minimum-spanning-trees/01_building-a-network.en.txt
7.36 KB
05_minimum-spanning-trees/01_minimum-spanning-trees/01_building-a-network.mp4
15.74 MB
05_minimum-spanning-trees/01_minimum-spanning-trees/02_greedy-algorithms.en.srt
4.75 KB
05_minimum-spanning-trees/01_minimum-spanning-trees/02_greedy-algorithms.en.txt
2.87 KB
05_minimum-spanning-trees/01_minimum-spanning-trees/02_greedy-algorithms.mp4
8.84 MB
05_minimum-spanning-trees/01_minimum-spanning-trees/03_cut-property.en.srt
10.39 KB
05_minimum-spanning-trees/01_minimum-spanning-trees/03_cut-property.en.txt
6.5 KB
05_minimum-spanning-trees/01_minimum-spanning-trees/03_cut-property.mp4
22.56 MB
05_minimum-spanning-trees/01_minimum-spanning-trees/04_kruskals-algorithm.en.srt
17.95 KB
05_minimum-spanning-trees/01_minimum-spanning-trees/04_kruskals-algorithm.en.txt
11.15 KB
05_minimum-spanning-trees/01_minimum-spanning-trees/04_kruskals-algorithm.mp4
27.5 MB
05_minimum-spanning-trees/01_minimum-spanning-trees/05_prims-algorithm.en.srt
15.35 KB
05_minimum-spanning-trees/01_minimum-spanning-trees/05_prims-algorithm.en.txt
9.44 KB
05_minimum-spanning-trees/01_minimum-spanning-trees/05_prims-algorithm.mp4
24.09 MB
05_minimum-spanning-trees/01_minimum-spanning-trees/06_slides-and-external-references_11_1_minimum_spanning_trees.pdf
493.03 KB
05_minimum-spanning-trees/01_minimum-spanning-trees/06_slides-and-external-references_Kruskal.html
2.8 KB
05_minimum-spanning-trees/01_minimum-spanning-trees/06_slides-and-external-references_instructions.html
1.46 KB
05_minimum-spanning-trees/02_programming-assignment/01_programming-assignment-5-minimum-spanning-trees_11_spanning_trees_starter_files.zip
2.48 KB
05_minimum-spanning-trees/02_programming-assignment/01_programming-assignment-5-minimum-spanning-trees_instructions.html
1.26 KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/01_programming-project-introduction.en.srt
2.19 KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/01_programming-project-introduction.en.txt
1.4 KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/01_programming-project-introduction.mp4
2.99 MB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/02_bidirectional-search.en.srt
12.96 KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/02_bidirectional-search.en.txt
8.15 KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/02_bidirectional-search.mp4
19.64 MB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/03_six-handshakes.en.srt
8.94 KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/03_six-handshakes.en.txt
5.66 KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/03_six-handshakes.mp4
15.05 MB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/04_bidirectional-dijkstra.en.srt
7.37 KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/04_bidirectional-dijkstra.en.txt
4.56 KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/04_bidirectional-dijkstra.mp4
11.87 MB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/05_finding-shortest-path-after-meeting-in-the-middle.en.srt
10.47 KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/05_finding-shortest-path-after-meeting-in-the-middle.en.txt
6.65 KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/05_finding-shortest-path-after-meeting-in-the-middle.mp4
13.27 MB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/06_computing-the-distance.en.srt
3.13 KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/06_computing-the-distance.en.txt
1.98 KB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/06_computing-the-distance.mp4
5.42 MB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/07_slides-and-external-references_19_advanced_shortest_paths_1_bidirectional_dijkstra.pdf
1.75 MB
06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/07_slides-and-external-references_instructions.html
1.34 KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/01_a-algorithm.en.srt
13.63 KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/01_a-algorithm.en.txt
8.71 KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/01_a-algorithm.mp4
22.07 MB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/02_performance-of-a.en.srt
2.64 KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/02_performance-of-a.en.txt
1.69 KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/02_performance-of-a.mp4
4.78 MB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/03_bidirectional-a.en.srt
8.13 KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/03_bidirectional-a.en.txt
4.92 KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/03_bidirectional-a.mp4
14.61 MB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/04_potential-functions-and-lower-bounds.en.srt
7.89 KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/04_potential-functions-and-lower-bounds.en.txt
5.04 KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/04_potential-functions-and-lower-bounds.mp4
13.76 MB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/05_landmarks-optional.en.srt
12.44 KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/05_landmarks-optional.en.txt
7.86 KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/05_landmarks-optional.mp4
25.34 MB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/06_slides-and-external-references_19_advanced_shortest_paths_2_A_star.pdf
759.58 KB
06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/06_slides-and-external-references_instructions.html
1.38 KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/01_highway-hierarchies-and-node-importance.en.srt
10.25 KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/01_highway-hierarchies-and-node-importance.en.txt
6.53 KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/01_highway-hierarchies-and-node-importance.mp4
15.22 MB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/02_preprocessing.en.srt
10.39 KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/02_preprocessing.en.txt
6.46 KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/02_preprocessing.mp4
16.28 MB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/03_witness-search.en.srt
12.11 KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/03_witness-search.en.txt
7.57 KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/03_witness-search.mp4
21.44 MB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/04_query.en.srt
11.31 KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/04_query.en.txt
7.18 KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/04_query.mp4
17.64 MB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/05_proof-of-correctness.en.srt
11.34 KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/05_proof-of-correctness.en.txt
7.11 KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/05_proof-of-correctness.mp4
20.99 MB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/06_node-ordering.en.srt
20.51 KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/06_node-ordering.en.txt
12.62 KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/06_node-ordering.mp4
30.25 MB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/07_slides-and-external-refernces_19_advanced_shortest_paths_3_contraction_hierarchies.pdf
1.62 MB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/07_slides-and-external-refernces_HL-TR.pdf
1.58 MB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/07_slides-and-external-refernces_contract.pdf
359.11 KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/07_slides-and-external-refernces_download.shtml
19.3 KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/07_slides-and-external-refernces_instructions.html
2.22 KB
06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/07_slides-and-external-refernces_midas-werneck.pdf
6.02 MB
06_advanced-shortest-paths-project-optional/04_programming-project/01_advanced-shortest-paths_Advanced_Shortest_Paths.pdf
1.83 MB
06_advanced-shortest-paths-project-optional/04_programming-project/01_advanced-shortest-paths_Advanced_Shortest_Paths.zip
35.19 KB
06_advanced-shortest-paths-project-optional/04_programming-project/01_advanced-shortest-paths_instructions.html
1.79 KB
07_Resources/01_partner-specialization/01__resources.html
1.25 KB
[CourseClub.NET].url
123 B
[DesireCourse.Com].url
51 B