CourseClub NET Coursera - Algorithms on Graphs

1. 01_decomposition-of-graphs-1/02_graph-basics/01_graph-basics.mp48.55MB
2. 01_decomposition-of-graphs-1/02_graph-basics/02_representing-graphs.mp418.51MB
3. 01_decomposition-of-graphs-1/03_exploring-undirected-graphs/01_exploring-graphs.mp425.4MB
4. 01_decomposition-of-graphs-1/03_exploring-undirected-graphs/02_connectivity.mp49.6MB
5. 01_decomposition-of-graphs-1/03_exploring-undirected-graphs/03_previsit-and-postvisit-orderings.mp412.24MB
6. 02_decomposition-of-graphs-2/01_directed-graphs/01_directed-acyclic-graphs.mp413.13MB
7. 02_decomposition-of-graphs-2/01_directed-graphs/02_topological-sort.mp416.14MB
8. 02_decomposition-of-graphs-2/01_directed-graphs/03_strongly-connected-components.mp412.56MB
9. 02_decomposition-of-graphs-2/01_directed-graphs/04_computing-strongly-connected-components.mp418.86MB
10. 03_paths-in-graphs-1/01_most-direct-route/01_most-direct-route.mp417.8MB
11. 03_paths-in-graphs-1/01_most-direct-route/02_breadth-first-search.mp416.37MB
12. 03_paths-in-graphs-1/01_most-direct-route/03_breadth-first-search-continued.mp412.82MB
13. 03_paths-in-graphs-1/01_most-direct-route/04_implementation-and-analysis.mp421.55MB
14. 03_paths-in-graphs-1/01_most-direct-route/05_proof-of-correctness.mp414.65MB
15. 03_paths-in-graphs-1/01_most-direct-route/06_proof-of-correctness-continued.mp412.46MB
16. 03_paths-in-graphs-1/01_most-direct-route/07_shortest-path-tree.mp413.58MB
17. 03_paths-in-graphs-1/01_most-direct-route/08_reconstructing-the-shortest-path.mp47.94MB
18. 04_paths-in-graphs-2/01_fastest-route/01_fastest-route.mp414.95MB
19. 04_paths-in-graphs-2/01_fastest-route/02_naive-algorithm.mp423.92MB
20. 04_paths-in-graphs-2/01_fastest-route/03_dijkstras-algorithm-intuition-and-example.mp415.67MB
21. 04_paths-in-graphs-2/01_fastest-route/04_dijkstras-algorithm-implementation.mp48.12MB
22. 04_paths-in-graphs-2/01_fastest-route/05_dijkstras-algorithm-proof-of-correctness.mp410.8MB
23. 04_paths-in-graphs-2/01_fastest-route/06_dijkstras-algorithm-running-time.mp415.94MB
24. 04_paths-in-graphs-2/02_currency-exchange/01_currency-exchange.mp412.78MB
25. 04_paths-in-graphs-2/02_currency-exchange/02_currency-exchange-reduction-to-shortest-paths.mp416.15MB
26. 04_paths-in-graphs-2/02_currency-exchange/03_bellman-ford-algorithm.mp411.48MB
27. 04_paths-in-graphs-2/02_currency-exchange/04_bellman-ford-algorithm-proof-of-correctness.mp413.03MB
28. 04_paths-in-graphs-2/02_currency-exchange/05_negative-cycles.mp415.45MB
29. 04_paths-in-graphs-2/02_currency-exchange/06_infinite-arbitrage.mp421.85MB
30. 05_minimum-spanning-trees/01_minimum-spanning-trees/01_building-a-network.mp415.74MB
31. 05_minimum-spanning-trees/01_minimum-spanning-trees/02_greedy-algorithms.mp48.84MB
32. 05_minimum-spanning-trees/01_minimum-spanning-trees/03_cut-property.mp422.56MB
33. 05_minimum-spanning-trees/01_minimum-spanning-trees/04_kruskals-algorithm.mp427.5MB
34. 05_minimum-spanning-trees/01_minimum-spanning-trees/05_prims-algorithm.mp424.09MB
35. 06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/01_programming-project-introduction.mp42.99MB
36. 06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/02_bidirectional-search.mp419.64MB
37. 06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/03_six-handshakes.mp415.05MB
38. 06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/04_bidirectional-dijkstra.mp411.87MB
39. 06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/05_finding-shortest-path-after-meeting-in-the-middle.mp413.27MB
40. 06_advanced-shortest-paths-project-optional/01_bidirectional-dijkstra/06_computing-the-distance.mp45.42MB
41. 06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/01_a-algorithm.mp422.07MB
42. 06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/02_performance-of-a.mp44.78MB
43. 06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/03_bidirectional-a.mp414.61MB
44. 06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/04_potential-functions-and-lower-bounds.mp413.76MB
45. 06_advanced-shortest-paths-project-optional/02_a-star-algorithm-a/05_landmarks-optional.mp425.34MB
46. 06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/01_highway-hierarchies-and-node-importance.mp415.22MB
47. 06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/02_preprocessing.mp416.28MB
48. 06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/03_witness-search.mp421.44MB
49. 06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/04_query.mp417.64MB
50. 06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/05_proof-of-correctness.mp420.99MB
51. 06_advanced-shortest-paths-project-optional/03_contraction-hierarchies/06_node-ordering.mp430.25MB