FreeCoursesOnline Me Coursera algorithms on graphs | 0618AFBB77246B2C174F26ED4C904B1D4899D304

FreeCoursesOnline Me Coursera algorithms on graphs

Name	[FreeCoursesOnline.Me] Coursera - algorithms-on-graphs	DOWNLOAD Copy Link Trouble downloading? see How To
Total Size	868.9 MB
Total Files	254
Hash	0618AFBB77246B2C174F26ED4C904B1D4899D304

/01_welcome/
01_welcome_instructions.html	4.1 KB
/.../02_graph-basics/
01_graph-basics.en.srt	7.4 KB
01_graph-basics.en.txt	4.7 KB
01_graph-basics.mp4	9.0 MB
01_graph-basics.zh-CN.srt	6.4 KB
01_graph-basics.zh-CN.txt	3.7 KB
02_representing-graphs.en.srt	15.4 KB
02_representing-graphs.en.txt	9.8 KB
02_representing-graphs.mp4	19.4 MB
03_slides-and-external-references_09_graph_decomposition_1_basics.pdf	2.9 MB
03_slides-and-external-references_09_graph_decomposition_2_representations.pdf	212.8 KB
03_slides-and-external-references_instructions.html	1.8 KB
/.../03_exploring-undirected-graphs/
01_exploring-graphs.en.srt	23.6 KB
01_exploring-graphs.en.txt	14.8 KB
01_exploring-graphs.mp4	26.6 MB
02_connectivity.en.srt	9.4 KB
02_connectivity.en.txt	5.9 KB
02_connectivity.mp4	10.1 MB
03_previsit-and-postvisit-orderings.en.srt	12.3 KB
03_previsit-and-postvisit-orderings.en.txt	7.6 KB
03_previsit-and-postvisit-orderings.mp4	12.8 MB
04_slides-and-external-references_09_graph_decomposition_3_explore.pdf	579.2 KB
04_slides-and-external-references_09_graph_decomposition_4_connectivity.pdf	404.4 KB
04_slides-and-external-references_09_graph_decomposition_5_pre-and-post-orders.pdf	437.3 KB
04_slides-and-external-references_DFS.html	2.9 KB
04_slides-and-external-references_instructions.html	1.8 KB
/.../04_programming-assignment/
01_programming-assignment-1-decomposition-of-graphs_09_graph_decomposition_problems_1.pdf	287.4 KB
01_programming-assignment-1-decomposition-of-graphs_09_graph_decomposition_starter_files_1.zip	287.7 KB
01_programming-assignment-1-decomposition-of-graphs_instructions.html	1.8 KB
/.../01_directed-graphs/
01_directed-acyclic-graphs.en.srt	12.6 KB
01_directed-acyclic-graphs.en.txt	7.9 KB
01_directed-acyclic-graphs.mp4	13.8 MB
02_topological-sort.en.srt	14.2 KB
02_topological-sort.en.txt	8.8 KB
02_topological-sort.mp4	16.9 MB
03_strongly-connected-components.en.srt	12.3 KB
03_strongly-connected-components.en.txt	7.7 KB
03_strongly-connected-components.mp4	13.2 MB
04_computing-strongly-connected-components.en.srt	16.6 KB
04_computing-strongly-connected-components.en.txt	10.3 KB
04_computing-strongly-connected-components.mp4	19.8 MB
05_slides-and-external-references_09_graph_decomposition_6_dags.pdf	239.9 KB
05_slides-and-external-references_09_graph_decomposition_7_topological-sort.pdf	673.6 KB
05_slides-and-external-references_09_graph_decomposition_8_strongly-connected-components.pdf	211.8 KB
05_slides-and-external-references_09_graph_decomposition_9_computing-sccs.pdf	666.1 KB
05_slides-and-external-references_ConnectedComponent.html	2.9 KB
05_slides-and-external-references_instructions.html	2.4 KB
05_slides-and-external-references_TopoSortDFS.html	2.9 KB
05_slides-and-external-references_TopoSortIndegree.html	2.9 KB
/.../02_programming-assignment/
01_programming-assignment-2-decomposition-of-graphs_09_graph_decomposition_problems_2.pdf	490.1 KB
01_programming-assignment-2-decomposition-of-graphs_09_graph_decomposition_starter_files_2.zip	4.2 KB
01_programming-assignment-2-decomposition-of-graphs_instructions.html	1.4 KB
/.../01_most-direct-route/
01_most-direct-route.en.srt	12.5 KB
01_most-direct-route.en.txt	7.9 KB
01_most-direct-route.mp4	18.7 MB
02_breadth-first-search.en.srt	10.6 KB
02_breadth-first-search.en.txt	6.6 KB
02_breadth-first-search.mp4	17.2 MB
03_breadth-first-search-continued.en.srt	8.8 KB
03_breadth-first-search-continued.en.txt	5.4 KB
03_breadth-first-search-continued.mp4	13.4 MB
04_implementation-and-analysis.en.srt	12.2 KB
04_implementation-and-analysis.en.txt	7.7 KB
04_implementation-and-analysis.mp4	22.6 MB
04_implementation-and-analysis.ne.srt	12.2 KB
04_implementation-and-analysis.ne.txt	7.7 KB
05_proof-of-correctness.en.srt	9.4 KB
05_proof-of-correctness.en.txt	5.7 KB
05_proof-of-correctness.mp4	15.4 MB
06_proof-of-correctness-continued.en.srt	7.4 KB
06_proof-of-correctness-continued.en.txt	4.7 KB
06_proof-of-correctness-continued.mp4	13.1 MB
07_shortest-path-tree.en.srt	8.0 KB
07_shortest-path-tree.en.txt	5.0 KB
07_shortest-path-tree.mp4	14.2 MB
08_reconstructing-the-shortest-path.de.srt	4.7 KB
08_reconstructing-the-shortest-path.de.txt	2.9 KB
08_reconstructing-the-shortest-path.en.srt	4.7 KB
08_reconstructing-the-shortest-path.en.txt	2.9 KB
08_reconstructing-the-shortest-path.et.srt	4.7 KB
08_reconstructing-the-shortest-path.et.txt	2.9 KB
08_reconstructing-the-shortest-path.ja.srt	4.7 KB
08_reconstructing-the-shortest-path.ja.txt	2.9 KB
08_reconstructing-the-shortest-path.kk.srt	4.7 KB
08_reconstructing-the-shortest-path.kk.txt	2.9 KB
08_reconstructing-the-shortest-path.lt.srt	4.7 KB
08_reconstructing-the-shortest-path.lt.txt	2.9 KB
08_reconstructing-the-shortest-path.mn.srt	4.9 KB
08_reconstructing-the-shortest-path.mn.txt	3.2 KB
08_reconstructing-the-shortest-path.mp4	8.3 MB
08_reconstructing-the-shortest-path.ne.srt	4.7 KB
08_reconstructing-the-shortest-path.ne.txt	2.9 KB
08_reconstructing-the-shortest-path.ro.srt	4.7 KB
08_reconstructing-the-shortest-path.ro.txt	2.9 KB
08_reconstructing-the-shortest-path.sk.srt	4.7 KB
08_reconstructing-the-shortest-path.sk.txt	2.9 KB
08_reconstructing-the-shortest-path.sq.srt	4.7 KB
08_reconstructing-the-shortest-path.sq.txt	2.9 KB
08_reconstructing-the-shortest-path.sr.srt	4.7 KB
08_reconstructing-the-shortest-path.sr.txt	2.9 KB
08_reconstructing-the-shortest-path.sv.srt	4.7 KB
08_reconstructing-the-shortest-path.sv.txt	2.9 KB
08_reconstructing-the-shortest-path.ta.srt	4.8 KB
08_reconstructing-the-shortest-path.ta.txt	3.0 KB
08_reconstructing-the-shortest-path.te.srt	4.7 KB
08_reconstructing-the-shortest-path.te.txt	2.9 KB
08_reconstructing-the-shortest-path.th.srt	4.7 KB
08_reconstructing-the-shortest-path.th.txt	2.9 KB
08_reconstructing-the-shortest-path.tr.srt	4.7 KB
08_reconstructing-the-shortest-path.tr.txt	2.9 KB
09_slides-and-external-references_10_shortest_paths_in_graphs_1_bfs.pdf	2.2 MB
09_slides-and-external-references_BFS.html	2.8 KB
09_slides-and-external-references_instructions.html	1.9 KB
/.../02_programming-assignment/
01_programming-assignment-3-paths-in-graphs_10_paths_in_graphs_problems_1.pdf	372.0 KB
01_programming-assignment-3-paths-in-graphs_10_paths_in_graphs_starter_files_1.zip	2.6 KB
01_programming-assignment-3-paths-in-graphs_instructions.html	1.4 KB
/.../01_fastest-route/
01_fastest-route.en.srt	8.8 KB
01_fastest-route.en.txt	5.5 KB
01_fastest-route.mp4	15.7 MB
02_naive-algorithm.en.srt	13.6 KB
02_naive-algorithm.en.txt	8.5 KB
02_naive-algorithm.mp4	25.1 MB
02_naive-algorithm.sq.srt	13.6 KB
02_naive-algorithm.sq.txt	8.5 KB
02_naive-algorithm.te.srt	13.6 KB
02_naive-algorithm.te.txt	8.5 KB
03_dijkstras-algorithm-intuition-and-example.en.srt	9.9 KB
03_dijkstras-algorithm-intuition-and-example.en.txt	6.2 KB
03_dijkstras-algorithm-intuition-and-example.mp4	16.4 MB
04_dijkstras-algorithm-implementation.en.srt	4.5 KB
04_dijkstras-algorithm-implementation.en.txt	2.8 KB
04_dijkstras-algorithm-implementation.mp4	8.5 MB
05_dijkstras-algorithm-proof-of-correctness.en.srt	6.4 KB
05_dijkstras-algorithm-proof-of-correctness.en.txt	4.0 KB
05_dijkstras-algorithm-proof-of-correctness.mp4	11.3 MB
06_dijkstras-algorithm-running-time.en.srt	9.4 KB
06_dijkstras-algorithm-running-time.en.txt	6.1 KB
06_dijkstras-algorithm-running-time.mp4	16.7 MB
07_slides-and-external-references_10_shortest_paths_in_graphs_2_dijkstra.pdf	1.1 MB
07_slides-and-external-references_Dijkstra.html	2.9 KB
07_slides-and-external-references_instructions.html	1.5 KB
/.../02_currency-exchange/
01_currency-exchange.en.srt	7.9 KB
01_currency-exchange.en.txt	4.9 KB
01_currency-exchange.mp4	13.4 MB
02_currency-exchange-reduction-to-shortest-paths.en.srt	10.4 KB
02_currency-exchange-reduction-to-shortest-paths.en.txt	6.6 KB
02_currency-exchange-reduction-to-shortest-paths.mp4	16.9 MB
03_bellman-ford-algorithm.en.srt	7.8 KB
03_bellman-ford-algorithm.en.txt	4.8 KB
03_bellman-ford-algorithm.mp4	12.0 MB
03_bellman-ford-algorithm.ru.srt	12.0 KB
03_bellman-ford-algorithm.ru.txt	8.9 KB
04_bellman-ford-algorithm-proof-of-correctness.en.srt	7.1 KB
04_bellman-ford-algorithm-proof-of-correctness.en.txt	4.5 KB
04_bellman-ford-algorithm-proof-of-correctness.mp4	13.7 MB
05_negative-cycles.en.srt	9.7 KB
05_negative-cycles.en.txt	6.1 KB
05_negative-cycles.mp4	16.2 MB
06_infinite-arbitrage.en.srt	13.6 KB
06_infinite-arbitrage.en.txt	8.6 KB
06_infinite-arbitrage.mp4	22.9 MB
07_slides-and-external-references_10_shortest_paths_in_graphs_3_bellman_ford.pdf	561.8 KB
07_slides-and-external-references_instructions.html	1.3 KB
/.../03_programming-assignment/
01_programming-assignment-4-paths-in-graphs_10_paths_in_graphs_problems_2.pdf	364.1 KB
01_programming-assignment-4-paths-in-graphs_10_paths_in_graphs_starter_files_2.zip	4.6 KB
01_programming-assignment-4-paths-in-graphs_instructions.html	1.3 KB
/.../01_minimum-spanning-trees/
01_building-a-network.en.srt	12.2 KB
01_building-a-network.en.txt	7.5 KB
01_building-a-network.mp4	16.5 MB
02_greedy-algorithms.en.srt	4.9 KB
02_greedy-algorithms.en.txt	2.9 KB
02_greedy-algorithms.mp4	9.3 MB
03_cut-property.en.srt	10.6 KB
03_cut-property.en.txt	6.7 KB
03_cut-property.mp4	23.7 MB
04_kruskals-algorithm.en.srt	18.4 KB
04_kruskals-algorithm.en.txt	11.4 KB
04_kruskals-algorithm.mp4	28.8 MB
05_prims-algorithm.en.srt	15.7 KB
05_prims-algorithm.en.txt	9.7 KB
05_prims-algorithm.mp4	25.3 MB
06_slides-and-external-references_11_1_minimum_spanning_trees.pdf	504.9 KB
06_slides-and-external-references_instructions.html	1.5 KB
06_slides-and-external-references_Kruskal.html	2.9 KB
/.../02_programming-assignment/
01_programming-assignment-5-minimum-spanning-trees_11_spanning_trees_starter_files.zip	2.5 KB
01_programming-assignment-5-minimum-spanning-trees_instructions.html	1.3 KB
/.../01_bidirectional-dijkstra/
01_programming-project-introduction.en.srt	2.2 KB
01_programming-project-introduction.en.txt	1.4 KB
01_programming-project-introduction.mp4	3.1 MB
02_bidirectional-search.en.srt	13.3 KB
02_bidirectional-search.en.txt	8.3 KB
02_bidirectional-search.mp4	20.6 MB
03_six-handshakes.en.srt	9.2 KB
03_six-handshakes.en.txt	5.8 KB
03_six-handshakes.mp4	15.8 MB
04_bidirectional-dijkstra.en.srt	7.5 KB
04_bidirectional-dijkstra.en.txt	4.7 KB
04_bidirectional-dijkstra.mp4	12.4 MB
05_finding-shortest-path-after-meeting-in-the-middle.en.srt	10.7 KB
05_finding-shortest-path-after-meeting-in-the-middle.en.txt	6.8 KB
05_finding-shortest-path-after-meeting-in-the-middle.mp4	13.9 MB
06_computing-the-distance.en.srt	3.2 KB
06_computing-the-distance.en.txt	2.0 KB
06_computing-the-distance.mp4	5.7 MB
07_slides-and-external-references_19_advanced_shortest_paths_1_bidirectional_dijkstra.pdf	1.8 MB
07_slides-and-external-references_instructions.html	1.4 KB
/.../02_a-star-algorithm-a/
01_a-algorithm.en.srt	14.0 KB
01_a-algorithm.en.txt	8.9 KB
01_a-algorithm.mp4	23.1 MB
02_performance-of-a.en.srt	2.7 KB
02_performance-of-a.en.txt	1.7 KB
02_performance-of-a.mp4	5.0 MB
03_bidirectional-a.en.srt	8.3 KB
03_bidirectional-a.en.txt	5.0 KB
03_bidirectional-a.mp4	15.3 MB
04_potential-functions-and-lower-bounds.en.srt	8.1 KB
04_potential-functions-and-lower-bounds.en.txt	5.2 KB
04_potential-functions-and-lower-bounds.mp4	14.4 MB
05_landmarks-optional.en.srt	12.7 KB
05_landmarks-optional.en.txt	8.0 KB
05_landmarks-optional.mp4	26.6 MB
06_slides-and-external-references_19_advanced_shortest_paths_2_A_star.pdf	777.8 KB
06_slides-and-external-references_instructions.html	1.4 KB
/.../03_contraction-hierarchies/
01_highway-hierarchies-and-node-importance.en.srt	10.5 KB
01_highway-hierarchies-and-node-importance.en.txt	6.7 KB
01_highway-hierarchies-and-node-importance.mp4	16.0 MB
02_preprocessing.en.srt	10.6 KB
02_preprocessing.en.txt	6.6 KB
02_preprocessing.mp4	17.1 MB
03_witness-search.en.srt	12.4 KB
03_witness-search.en.txt	7.8 KB
03_witness-search.mp4	22.5 MB
04_query.en.srt	11.6 KB
04_query.en.txt	7.4 KB
04_query.mp4	18.5 MB
05_proof-of-correctness.en.srt	11.6 KB
05_proof-of-correctness.en.txt	7.3 KB
05_proof-of-correctness.mp4	22.0 MB
06_node-ordering.en.srt	21.0 KB
06_node-ordering.en.txt	12.9 KB
06_node-ordering.mp4	31.7 MB
07_slides-and-external-refernces_19_advanced_shortest_paths_3_contraction_hierarchies.pdf	1.7 MB
07_slides-and-external-refernces_contract.pdf	367.7 KB
07_slides-and-external-refernces_download.shtml	20.2 KB
07_slides-and-external-refernces_HL-TR.pdf	1.7 MB
07_slides-and-external-refernces_instructions.html	2.3 KB
07_slides-and-external-refernces_midas-werneck.pdf	6.3 MB
/.../04_programming-project/
01_advanced-shortest-paths_Advanced_Shortest_Paths.pdf	1.9 MB
01_advanced-shortest-paths_Advanced_Shortest_Paths.zip	36.0 KB
01_advanced-shortest-paths_instructions.html	1.8 KB
/.../01_partner-specialization/
01__resources.html	1.3 KB
/
[FreeCoursesOnline.Me].url	0.1 KB
[FreeTutorials.Eu].url	0.1 KB
[FTU Forum].url	1.4 KB
Total files 254