|
|
01__resources.html
|
HTML
|
1.3 KB
|
|
|
01_a-algorithm.en.srt
|
SRT
|
13.6 KB
|
|
|
01_a-algorithm.en.txt
|
TXT
|
8.7 KB
|
|
|
01_a-algorithm.mp4
|
MP4
|
22.1 MB
|
|
|
01_advanced-shortest-paths_Advanced_Shortest_Paths.pdf
|
PDF
|
1.8 MB
|
|
|
01_advanced-shortest-paths_Advanced_Shortest_Paths.zip
|
ZIP
|
35.2 KB
|
|
|
01_advanced-shortest-paths_instructions.html
|
HTML
|
1.8 KB
|
|
|
01_building-a-network.en.srt
|
SRT
|
11.9 KB
|
|
|
01_building-a-network.en.txt
|
TXT
|
7.4 KB
|
|
|
01_building-a-network.mp4
|
MP4
|
15.7 MB
|
|
|
01_currency-exchange.en.srt
|
SRT
|
7.7 KB
|
|
|
01_currency-exchange.en.txt
|
TXT
|
4.8 KB
|
|
|
01_currency-exchange.mp4
|
MP4
|
12.8 MB
|
|
|
01_directed-acyclic-graphs.en.srt
|
SRT
|
12.3 KB
|
|
|
01_directed-acyclic-graphs.en.txt
|
TXT
|
7.7 KB
|
|
|
01_directed-acyclic-graphs.mp4
|
MP4
|
13.1 MB
|
|
|
01_exploring-graphs.en.srt
|
SRT
|
23.1 KB
|
|
|
01_exploring-graphs.en.txt
|
TXT
|
14.4 KB
|
|
|
01_exploring-graphs.mp4
|
MP4
|
25.4 MB
|
|
|
01_fastest-route.en.srt
|
SRT
|
8.6 KB
|
|
|
01_fastest-route.en.txt
|
TXT
|
5.4 KB
|
|
|
01_fastest-route.mp4
|
MP4
|
14.9 MB
|
|
|
01_graph-basics.en.srt
|
SRT
|
7.2 KB
|
|
|
01_graph-basics.en.txt
|
TXT
|
4.6 KB
|
|
|
01_graph-basics.mp4
|
MP4
|
8.5 MB
|
|
|
01_graph-basics.zh-CN.srt
|
SRT
|
6.3 KB
|
|
|
01_graph-basics.zh-CN.txt
|
TXT
|
3.6 KB
|
|
|
01_highway-hierarchies-and-node-importance.en.srt
|
SRT
|
10.2 KB
|
|
|
01_highway-hierarchies-and-node-importance.en.txt
|
TXT
|
6.5 KB
|
|
|
01_highway-hierarchies-and-node-importance.mp4
|
MP4
|
15.2 MB
|
|
|
01_most-direct-route.en.srt
|
SRT
|
12.2 KB
|
|
|
01_most-direct-route.en.txt
|
TXT
|
7.7 KB
|
|
|
01_most-direct-route.mp4
|
MP4
|
17.8 MB
|
|
|
01_programming-assignment-1-decomposition-of-graphs_09_graph_decomposition_problems_1.pdf
|
PDF
|
280.7 KB
|
|
|
01_programming-assignment-1-decomposition-of-graphs_09_graph_decomposition_starter_files_1.zip
|
ZIP
|
280.9 KB
|
|
|
01_programming-assignment-1-decomposition-of-graphs_instructions.html
|
HTML
|
1.7 KB
|
|
|
01_programming-assignment-2-decomposition-of-graphs_09_graph_decomposition_problems_2.pdf
|
PDF
|
478.6 KB
|
|
|
01_programming-assignment-2-decomposition-of-graphs_09_graph_decomposition_starter_files_2.zip
|
ZIP
|
4.1 KB
|
|
|
01_programming-assignment-2-decomposition-of-graphs_instructions.html
|
HTML
|
1.3 KB
|
|
|
01_programming-assignment-3-paths-in-graphs_10_paths_in_graphs_problems_1.pdf
|
PDF
|
363.3 KB
|
|
|
01_programming-assignment-3-paths-in-graphs_10_paths_in_graphs_starter_files_1.zip
|
ZIP
|
2.5 KB
|
|
|
01_programming-assignment-3-paths-in-graphs_instructions.html
|
HTML
|
1.4 KB
|
|
|
01_programming-assignment-4-paths-in-graphs_10_paths_in_graphs_problems_2.pdf
|
PDF
|
355.6 KB
|
|
|
01_programming-assignment-4-paths-in-graphs_10_paths_in_graphs_starter_files_2.zip
|
ZIP
|
4.5 KB
|
|
|
01_programming-assignment-4-paths-in-graphs_instructions.html
|
HTML
|
1.3 KB
|
|
|
01_programming-assignment-5-minimum-spanning-trees_11_spanning_trees_starter_files.zip
|
ZIP
|
2.5 KB
|
|
|
01_programming-assignment-5-minimum-spanning-trees_instructions.html
|
HTML
|
1.3 KB
|
|
|
01_programming-project-introduction.en.srt
|
SRT
|
2.2 KB
|
|
|
01_programming-project-introduction.en.txt
|
TXT
|
1.4 KB
|
|
|
01_programming-project-introduction.mp4
|
MP4
|
3 MB
|
|
|
01_welcome_instructions.html
|
HTML
|
4 KB
|
|
|
02_bidirectional-search.en.srt
|
SRT
|
13 KB
|
|
|
02_bidirectional-search.en.txt
|
TXT
|
8.1 KB
|
|
|
02_bidirectional-search.mp4
|
MP4
|
19.6 MB
|
|
|
02_breadth-first-search.en.srt
|
SRT
|
10.3 KB
|
|
|
02_breadth-first-search.en.txt
|
TXT
|
6.5 KB
|
|
|
02_breadth-first-search.mp4
|
MP4
|
16.4 MB
|
|
|
02_connectivity.en.srt
|
SRT
|
9.1 KB
|
|
|
02_connectivity.en.txt
|
TXT
|
5.7 KB
|
|
|
02_connectivity.mp4
|
MP4
|
9.6 MB
|
|
|
02_currency-exchange-reduction-to-shortest-paths.en.srt
|
SRT
|
10.1 KB
|
|
|
02_currency-exchange-reduction-to-shortest-paths.en.txt
|
TXT
|
6.4 KB
|
|
|
02_currency-exchange-reduction-to-shortest-paths.mp4
|
MP4
|
16.2 MB
|
|
|
02_greedy-algorithms.en.srt
|
SRT
|
4.8 KB
|
|
|
02_greedy-algorithms.en.txt
|
TXT
|
2.9 KB
|
|
|
02_greedy-algorithms.mp4
|
MP4
|
8.8 MB
|
|
|
02_naive-algorithm.en.srt
|
SRT
|
13.3 KB
|
|
|
02_naive-algorithm.en.txt
|
TXT
|
8.3 KB
|
|
|
02_naive-algorithm.mp4
|
MP4
|
23.9 MB
|
|
|
02_naive-algorithm.sq.srt
|
SRT
|
13.3 KB
|
|
|
02_naive-algorithm.sq.txt
|
TXT
|
8.3 KB
|
|
|
02_naive-algorithm.te.srt
|
SRT
|
13.3 KB
|
|
|
02_naive-algorithm.te.txt
|
TXT
|
8.3 KB
|
|
|
02_performance-of-a.en.srt
|
SRT
|
2.6 KB
|
|
|
02_performance-of-a.en.txt
|
TXT
|
1.7 KB
|
|
|
02_performance-of-a.mp4
|
MP4
|
4.8 MB
|
|
|
02_preprocessing.en.srt
|
SRT
|
10.4 KB
|
|
|
02_preprocessing.en.txt
|
TXT
|
6.5 KB
|
|
|
02_preprocessing.mp4
|
MP4
|
16.3 MB
|
|
|
02_representing-graphs.en.srt
|
SRT
|
15.1 KB
|
|
|
02_representing-graphs.en.txt
|
TXT
|
9.5 KB
|
|
|
02_representing-graphs.mp4
|
MP4
|
18.5 MB
|
|
|
02_topological-sort.en.srt
|
SRT
|
13.9 KB
|
|
|
02_topological-sort.en.txt
|
TXT
|
8.6 KB
|
|
|
02_topological-sort.mp4
|
MP4
|
16.1 MB
|
|
|
03_bellman-ford-algorithm.en.srt
|
SRT
|
7.7 KB
|
|
|
03_bellman-ford-algorithm.en.txt
|
TXT
|
4.6 KB
|
|
|
03_bellman-ford-algorithm.mp4
|
MP4
|
11.5 MB
|
|
|
03_bellman-ford-algorithm.ru.srt
|
SRT
|
11.7 KB
|
|
|
03_bellman-ford-algorithm.ru.txt
|
TXT
|
8.7 KB
|
|
|
03_bidirectional-a.en.srt
|
SRT
|
8.1 KB
|
|
|
03_bidirectional-a.en.txt
|
TXT
|
4.9 KB
|
|
|
03_bidirectional-a.mp4
|
MP4
|
14.6 MB
|
|
|
03_breadth-first-search-continued.en.srt
|
SRT
|
8.5 KB
|
|
|
03_breadth-first-search-continued.en.txt
|
TXT
|
5.3 KB
|
|
|
03_breadth-first-search-continued.mp4
|
MP4
|
12.8 MB
|
|
|
03_cut-property.en.srt
|
SRT
|
10.4 KB
|
|
|
03_cut-property.en.txt
|
TXT
|
6.5 KB
|
|
|
03_cut-property.mp4
|
MP4
|
22.6 MB
|
|
|
03_dijkstras-algorithm-intuition-and-example.en.srt
|
SRT
|
9.7 KB
|
|
|
03_dijkstras-algorithm-intuition-and-example.en.txt
|
TXT
|
6 KB
|
|
|
03_dijkstras-algorithm-intuition-and-example.mp4
|
MP4
|
15.7 MB
|
|
|
03_previsit-and-postvisit-orderings.en.srt
|
SRT
|
12 KB
|
|
|
03_previsit-and-postvisit-orderings.en.txt
|
TXT
|
7.4 KB
|
|
|
03_previsit-and-postvisit-orderings.mp4
|
MP4
|
12.2 MB
|
|
|
03_six-handshakes.en.srt
|
SRT
|
8.9 KB
|
|
|
03_six-handshakes.en.txt
|
TXT
|
5.7 KB
|
|
|
03_six-handshakes.mp4
|
MP4
|
15 MB
|
|
|
03_slides-and-external-references_09_graph_decomposition_1_basics.pdf
|
PDF
|
2.7 MB
|
|
|
03_slides-and-external-references_09_graph_decomposition_2_representations.pdf
|
PDF
|
207.9 KB
|
|
|
03_slides-and-external-references_instructions.html
|
HTML
|
1.7 KB
|
|
|
03_strongly-connected-components.en.srt
|
SRT
|
12 KB
|
|
|
03_strongly-connected-components.en.txt
|
TXT
|
7.5 KB
|
|
|
03_strongly-connected-components.mp4
|
MP4
|
12.6 MB
|
|
|
03_witness-search.en.srt
|
SRT
|
12.1 KB
|
|
|
03_witness-search.en.txt
|
TXT
|
7.6 KB
|
|
|
03_witness-search.mp4
|
MP4
|
21.4 MB
|
|
|
04_bellman-ford-algorithm-proof-of-correctness.en.srt
|
SRT
|
6.9 KB
|
|
|
04_bellman-ford-algorithm-proof-of-correctness.en.txt
|
TXT
|
4.4 KB
|
|
|
04_bellman-ford-algorithm-proof-of-correctness.mp4
|
MP4
|
13 MB
|
|
|
04_bidirectional-dijkstra.en.srt
|
SRT
|
7.4 KB
|
|
|
04_bidirectional-dijkstra.en.txt
|
TXT
|
4.6 KB
|
|
|
04_bidirectional-dijkstra.mp4
|
MP4
|
11.9 MB
|
|
|
04_computing-strongly-connected-components.en.srt
|
SRT
|
16.2 KB
|
|
|
04_computing-strongly-connected-components.en.txt
|
TXT
|
10.1 KB
|
|
|
04_computing-strongly-connected-components.mp4
|
MP4
|
18.9 MB
|
|
|
04_dijkstras-algorithm-implementation.en.srt
|
SRT
|
4.4 KB
|
|
|
04_dijkstras-algorithm-implementation.en.txt
|
TXT
|
2.8 KB
|
|
|
04_dijkstras-algorithm-implementation.mp4
|
MP4
|
8.1 MB
|
|
|
04_implementation-and-analysis.en.srt
|
SRT
|
11.9 KB
|
|
|
04_implementation-and-analysis.en.txt
|
TXT
|
7.5 KB
|
|
|
04_implementation-and-analysis.mp4
|
MP4
|
21.5 MB
|
|
|
04_implementation-and-analysis.ne.srt
|
SRT
|
11.9 KB
|
|
|
04_implementation-and-analysis.ne.txt
|
TXT
|
7.5 KB
|
|
|
04_kruskals-algorithm.en.srt
|
SRT
|
18 KB
|
|
|
04_kruskals-algorithm.en.txt
|
TXT
|
11.2 KB
|
|
|
04_kruskals-algorithm.mp4
|
MP4
|
27.5 MB
|
|
|
04_potential-functions-and-lower-bounds.en.srt
|
SRT
|
7.9 KB
|
|
|
04_potential-functions-and-lower-bounds.en.txt
|
TXT
|
5 KB
|
|
|
04_potential-functions-and-lower-bounds.mp4
|
MP4
|
13.8 MB
|
|
|
04_query.en.srt
|
SRT
|
11.3 KB
|
|
|
04_query.en.txt
|
TXT
|
7.2 KB
|
|
|
04_query.mp4
|
MP4
|
17.6 MB
|
|
|
04_slides-and-external-references_09_graph_decomposition_3_explore.pdf
|
PDF
|
565.6 KB
|
|
|
04_slides-and-external-references_09_graph_decomposition_4_connectivity.pdf
|
PDF
|
394.9 KB
|
|
|
04_slides-and-external-references_09_graph_decomposition_5_pre-and-post-orders.pdf
|
PDF
|
427.1 KB
|
|
|
04_slides-and-external-references_DFS.html
|
HTML
|
2.8 KB
|
|
|
04_slides-and-external-references_instructions.html
|
HTML
|
1.7 KB
|
|
|
05_dijkstras-algorithm-proof-of-correctness.en.srt
|
SRT
|
6.3 KB
|
|
|
05_dijkstras-algorithm-proof-of-correctness.en.txt
|
TXT
|
3.9 KB
|
|
|
05_dijkstras-algorithm-proof-of-correctness.mp4
|
MP4
|
10.8 MB
|
|
|
05_finding-shortest-path-after-meeting-in-the-middle.en.srt
|
SRT
|
10.5 KB
|
|
|
05_finding-shortest-path-after-meeting-in-the-middle.en.txt
|
TXT
|
6.6 KB
|
|
|
05_finding-shortest-path-after-meeting-in-the-middle.mp4
|
MP4
|
13.3 MB
|
|
|
05_landmarks-optional.en.srt
|
SRT
|
12.4 KB
|
|
|
05_landmarks-optional.en.txt
|
TXT
|
7.9 KB
|
|
|
05_landmarks-optional.mp4
|
MP4
|
25.3 MB
|
|
|
05_negative-cycles.en.srt
|
SRT
|
9.5 KB
|
|
|
05_negative-cycles.en.txt
|
TXT
|
6 KB
|
|
|
05_negative-cycles.mp4
|
MP4
|
15.4 MB
|
|
|
05_prims-algorithm.en.srt
|
SRT
|
15.3 KB
|
|
|
05_prims-algorithm.en.txt
|
TXT
|
9.4 KB
|
|
|
05_prims-algorithm.mp4
|
MP4
|
24.1 MB
|
|
|
05_proof-of-correctness.en.srt
|
SRT
|
11.3 KB
|
|
|
05_proof-of-correctness.en.txt
|
TXT
|
7.1 KB
|
|
|
05_proof-of-correctness.mp4
|
MP4
|
21 MB
|
|
|
05_slides-and-external-references_09_graph_decomposition_6_dags.pdf
|
PDF
|
234.2 KB
|
|
|
05_slides-and-external-references_09_graph_decomposition_7_topological-sort.pdf
|
PDF
|
657.8 KB
|
|
|
05_slides-and-external-references_09_graph_decomposition_8_strongly-connected-components.pdf
|
PDF
|
206.9 KB
|
|
|
05_slides-and-external-references_09_graph_decomposition_9_computing-sccs.pdf
|
PDF
|
650.5 KB
|
|
|
05_slides-and-external-references_ConnectedComponent.html
|
HTML
|
2.8 KB
|
|
|
05_slides-and-external-references_TopoSortDFS.html
|
HTML
|
2.8 KB
|
|
|
05_slides-and-external-references_TopoSortIndegree.html
|
HTML
|
2.8 KB
|
|
|
05_slides-and-external-references_instructions.html
|
HTML
|
2.3 KB
|
|
|
06_computing-the-distance.en.srt
|
SRT
|
3.1 KB
|
|
|
06_computing-the-distance.en.txt
|
TXT
|
2 KB
|
|
|
06_computing-the-distance.mp4
|
MP4
|
5.4 MB
|
|
|
06_dijkstras-algorithm-running-time.en.srt
|
SRT
|
9.2 KB
|
|
|
06_dijkstras-algorithm-running-time.en.txt
|
TXT
|
5.9 KB
|
|
|
06_dijkstras-algorithm-running-time.mp4
|
MP4
|
15.9 MB
|
|
|
06_infinite-arbitrage.en.srt
|
SRT
|
13.3 KB
|
|
|
06_infinite-arbitrage.en.txt
|
TXT
|
8.4 KB
|
|
|
06_infinite-arbitrage.mp4
|
MP4
|
21.9 MB
|
|
|
06_node-ordering.en.srt
|
SRT
|
20.5 KB
|
|
|
06_node-ordering.en.txt
|
TXT
|
12.6 KB
|
|
|
06_node-ordering.mp4
|
MP4
|
30.3 MB
|
|
|
06_proof-of-correctness-continued.en.srt
|
SRT
|
7.2 KB
|
|
|
06_proof-of-correctness-continued.en.txt
|
TXT
|
4.6 KB
|
|
|
06_proof-of-correctness-continued.mp4
|
MP4
|
12.5 MB
|
|
|
06_slides-and-external-references_11_1_minimum_spanning_trees.pdf
|
PDF
|
493 KB
|
|
|
06_slides-and-external-references_19_advanced_shortest_paths_2_A_star.pdf
|
PDF
|
759.6 KB
|
|
|
06_slides-and-external-references_Kruskal.html
|
HTML
|
2.8 KB
|
|
|
06_slides-and-external-references_instructions.html
|
HTML
|
1.4 KB
|
|
|
07_shortest-path-tree.en.srt
|
SRT
|
7.8 KB
|
|
|
07_shortest-path-tree.en.txt
|
TXT
|
4.9 KB
|
|
|
07_shortest-path-tree.mp4
|
MP4
|
13.6 MB
|
|
|
07_slides-and-external-references_10_shortest_paths_in_graphs_2_dijkstra.pdf
|
PDF
|
1.1 MB
|
|
|
07_slides-and-external-references_10_shortest_paths_in_graphs_3_bellman_ford.pdf
|
PDF
|
548.7 KB
|
|
|
07_slides-and-external-references_19_advanced_shortest_paths_1_bidirectional_dijkstra.pdf
|
PDF
|
1.8 MB
|
|
|
07_slides-and-external-references_Dijkstra.html
|
HTML
|
2.8 KB
|
|
|
07_slides-and-external-references_instructions.html
|
HTML
|
1.3 KB
|
|
|
07_slides-and-external-refernces_19_advanced_shortest_paths_3_contraction_hierarchies.pdf
|
PDF
|
1.6 MB
|
|
|
07_slides-and-external-refernces_HL-TR.pdf
|
PDF
|
1.6 MB
|
|
|
07_slides-and-external-refernces_contract.pdf
|
PDF
|
359.1 KB
|
|
|
07_slides-and-external-refernces_download.shtml
|
SHTML
|
19.3 KB
|
|
|
07_slides-and-external-refernces_instructions.html
|
HTML
|
2.2 KB
|
|
|
07_slides-and-external-refernces_midas-werneck.pdf
|
PDF
|
6 MB
|
|
|
08_reconstructing-the-shortest-path.de.srt
|
SRT
|
4.6 KB
|
|
|
08_reconstructing-the-shortest-path.de.txt
|
TXT
|
2.8 KB
|
|
|
08_reconstructing-the-shortest-path.en.srt
|
SRT
|
4.6 KB
|
|
|
08_reconstructing-the-shortest-path.en.txt
|
TXT
|
2.8 KB
|
|
|
08_reconstructing-the-shortest-path.et.srt
|
SRT
|
4.6 KB
|
|
|
08_reconstructing-the-shortest-path.et.txt
|
TXT
|
2.8 KB
|
|
|
08_reconstructing-the-shortest-path.ja.srt
|
SRT
|
4.6 KB
|
|
|
08_reconstructing-the-shortest-path.ja.txt
|
TXT
|
2.8 KB
|
|
|
08_reconstructing-the-shortest-path.kk.srt
|
SRT
|
4.6 KB
|
|
|
08_reconstructing-the-shortest-path.kk.txt
|
TXT
|
2.8 KB
|
|
|
08_reconstructing-the-shortest-path.lt.srt
|
SRT
|
4.6 KB
|
|
|
08_reconstructing-the-shortest-path.lt.txt
|
TXT
|
2.8 KB
|
|
|
08_reconstructing-the-shortest-path.mn.srt
|
SRT
|
4.8 KB
|
|
|
08_reconstructing-the-shortest-path.mn.txt
|
TXT
|
3.1 KB
|
|
|
08_reconstructing-the-shortest-path.mp4
|
MP4
|
7.9 MB
|
|
|
08_reconstructing-the-shortest-path.ne.srt
|
SRT
|
4.6 KB
|
|
|
08_reconstructing-the-shortest-path.ne.txt
|
TXT
|
2.8 KB
|
|
|
08_reconstructing-the-shortest-path.ro.srt
|
SRT
|
4.6 KB
|
|
|
08_reconstructing-the-shortest-path.ro.txt
|
TXT
|
2.8 KB
|
|
|
08_reconstructing-the-shortest-path.sk.srt
|
SRT
|
4.6 KB
|
|
|
08_reconstructing-the-shortest-path.sk.txt
|
TXT
|
2.8 KB
|
|
|
08_reconstructing-the-shortest-path.sq.srt
|
SRT
|
4.6 KB
|
|
|
08_reconstructing-the-shortest-path.sq.txt
|
TXT
|
2.8 KB
|
|
|
08_reconstructing-the-shortest-path.sr.srt
|
SRT
|
4.6 KB
|
|
|
08_reconstructing-the-shortest-path.sr.txt
|
TXT
|
2.8 KB
|
|
|
08_reconstructing-the-shortest-path.sv.srt
|
SRT
|
4.6 KB
|
|
|
08_reconstructing-the-shortest-path.sv.txt
|
TXT
|
2.8 KB
|
|
|
08_reconstructing-the-shortest-path.ta.srt
|
SRT
|
4.7 KB
|
|
|
08_reconstructing-the-shortest-path.ta.txt
|
TXT
|
3 KB
|
|
|
08_reconstructing-the-shortest-path.te.srt
|
SRT
|
4.6 KB
|
|
|
08_reconstructing-the-shortest-path.te.txt
|
TXT
|
2.8 KB
|
|
|
08_reconstructing-the-shortest-path.th.srt
|
SRT
|
4.6 KB
|
|
|
08_reconstructing-the-shortest-path.th.txt
|
TXT
|
2.9 KB
|
|
|
08_reconstructing-the-shortest-path.tr.srt
|
SRT
|
4.6 KB
|
|
|
08_reconstructing-the-shortest-path.tr.txt
|
TXT
|
2.8 KB
|
|
|
09_slides-and-external-references_10_shortest_paths_in_graphs_1_bfs.pdf
|
PDF
|
2.1 MB
|
|
|
09_slides-and-external-references_BFS.html
|
HTML
|
2.8 KB
|
|
|
09_slides-and-external-references_instructions.html
|
HTML
|
1.9 KB
|
|
|
[CourseClub.NET].url
|
URL
|
102.4 B
|
|
|
[DesireCourse.Com].url
|
URL
|
0 B
|
![[Coursera] Algorithms on Graphs](/static/img/no-torrent-image.png "[Coursera] Algorithms on Graphs")
