01_decomposition-of-graphs-1

  01_welcome

  02_graph-basics

   01_graph-basics.en.txt

   01_graph-basics.zh-CN.srt

   02_representing-graphs.en.srt

   02_representing-graphs.mp4

   03_slides-and-external-references_09_graph_decomposition_2_representations.pdf

  03_exploring-undirected-graphs

   01_exploring-graphs.en.txt

   02_connectivity.en.srt

   02_connectivity.mp4

   03_previsit-and-postvisit-orderings.en.txt

   04_slides-and-external-references_09_graph_decomposition_3_explore.pdf

   04_slides-and-external-references_09_graph_decomposition_5_pre-and-post-orders.pdf

   04_slides-and-external-references_instructions.html

  04_programming-assignment

   01_programming-assignment-1-decomposition-of-graphs_09_graph_decomposition_starter_files_1.zip

 02_decomposition-of-graphs-2

  01_directed-graphs

   01_directed-acyclic-graphs.en.txt

   02_topological-sort.en.srt

   02_topological-sort.mp4

   03_strongly-connected-components.en.txt

   04_computing-strongly-connected-components.en.srt

   04_computing-strongly-connected-components.mp4

   05_slides-and-external-references_09_graph_decomposition_7_topological-sort.pdf

   05_slides-and-external-references_09_graph_decomposition_9_computing-sccs.pdf

   05_slides-and-external-references_TopoSortDFS.html

   05_slides-and-external-references_instructions.html

  02_programming-assignment

   01_programming-assignment-2-decomposition-of-graphs_09_graph_decomposition_starter_files_2.zip

 03_paths-in-graphs-1

  01_most-direct-route

   01_most-direct-route.en.txt

   02_breadth-first-search.en.srt

   02_breadth-first-search.mp4

   03_breadth-first-search-continued.en.txt

   04_implementation-and-analysis.en.srt

   04_implementation-and-analysis.mp4

   04_implementation-and-analysis.ne.txt

   05_proof-of-correctness.en.txt

   06_proof-of-correctness-continued.en.srt

   06_proof-of-correctness-continued.mp4

   07_shortest-path-tree.en.txt

   08_reconstructing-the-shortest-path.de.srt

   08_reconstructing-the-shortest-path.en.srt

   08_reconstructing-the-shortest-path.et.srt

   08_reconstructing-the-shortest-path.ja.srt

   08_reconstructing-the-shortest-path.kk.srt

   08_reconstructing-the-shortest-path.lt.srt

   08_reconstructing-the-shortest-path.mn.srt

   08_reconstructing-the-shortest-path.mp4

   08_reconstructing-the-shortest-path.ne.txt

   08_reconstructing-the-shortest-path.ro.txt

   08_reconstructing-the-shortest-path.sk.txt

   08_reconstructing-the-shortest-path.sq.txt

   08_reconstructing-the-shortest-path.sr.txt

   08_reconstructing-the-shortest-path.sv.txt

   08_reconstructing-the-shortest-path.ta.txt

   08_reconstructing-the-shortest-path.te.txt

   08_reconstructing-the-shortest-path.th.txt

   08_reconstructing-the-shortest-path.tr.txt

   09_slides-and-external-references_BFS.html

  02_programming-assignment

   01_programming-assignment-3-paths-in-graphs_10_paths_in_graphs_starter_files_1.zip

 04_paths-in-graphs-2

  01_fastest-route

   01_fastest-route.en.txt

   02_naive-algorithm.en.srt

   02_naive-algorithm.mp4

   02_naive-algorithm.sq.txt

   02_naive-algorithm.te.txt

   03_dijkstras-algorithm-intuition-and-example.en.txt

   04_dijkstras-algorithm-implementation.en.srt

   04_dijkstras-algorithm-implementation.mp4

   05_dijkstras-algorithm-proof-of-correctness.en.txt

   06_dijkstras-algorithm-running-time.en.srt

   06_dijkstras-algorithm-running-time.mp4

   07_slides-and-external-references_Dijkstra.html

  02_currency-exchange

   01_currency-exchange.en.txt

   02_currency-exchange-reduction-to-shortest-paths.en.srt

   02_currency-exchange-reduction-to-shortest-paths.mp4

   03_bellman-ford-algorithm.en.txt

   03_bellman-ford-algorithm.ru.srt

   04_bellman-ford-algorithm-proof-of-correctness.en.srt

   04_bellman-ford-algorithm-proof-of-correctness.mp4

   05_negative-cycles.en.txt

   06_infinite-arbitrage.en.srt

   06_infinite-arbitrage.mp4

   07_slides-and-external-references_instructions.html

  03_programming-assignment

   01_programming-assignment-4-paths-in-graphs_10_paths_in_graphs_starter_files_2.zip

 05_minimum-spanning-trees

  01_minimum-spanning-trees

   01_building-a-network.en.txt

   02_greedy-algorithms.en.srt

   02_greedy-algorithms.mp4

   03_cut-property.en.txt

   04_kruskals-algorithm.en.srt

   04_kruskals-algorithm.mp4

   05_prims-algorithm.en.txt

   06_slides-and-external-references_11_1_minimum_spanning_trees.pdf

   06_slides-and-external-references_instructions.html

  02_programming-assignment

   01_programming-assignment-5-minimum-spanning-trees_instructions.html

 06_advanced-shortest-paths-project-optional

  01_bidirectional-dijkstra

   01_programming-project-introduction.en.txt

   02_bidirectional-search.en.srt

   02_bidirectional-search.mp4

   03_six-handshakes.en.txt

   04_bidirectional-dijkstra.en.srt

   04_bidirectional-dijkstra.mp4

   05_finding-shortest-path-after-meeting-in-the-middle.en.txt

   06_computing-the-distance.en.srt

   06_computing-the-distance.mp4

   07_slides-and-external-references_instructions.html

  02_a-star-algorithm-a

   01_a-algorithm.en.txt

   02_performance-of-a.en.srt

   02_performance-of-a.mp4

   03_bidirectional-a.en.txt

   04_potential-functions-and-lower-bounds.en.srt

   04_potential-functions-and-lower-bounds.mp4

   05_landmarks-optional.en.txt

   06_slides-and-external-references_19_advanced_shortest_paths_2_A_star.pdf

  03_contraction-hierarchies

   01_highway-hierarchies-and-node-importance.en.txt

   02_preprocessing.en.srt

   02_preprocessing.mp4

   03_witness-search.en.txt

   04_query.en.srt

   04_query.mp4

   05_proof-of-correctness.en.txt

   06_node-ordering.en.srt

   06_node-ordering.mp4

   07_slides-and-external-refernces_HL-TR.pdf

   07_slides-and-external-refernces_download.shtml

   07_slides-and-external-refernces_midas-werneck.pdf

  04_programming-project

   01_advanced-shortest-paths_Advanced_Shortest_Paths.zip

 07_Resources

  01_partner-specialization

 [CourseClub.NET].url