15_flows_1_transporting_goods_1648282309535.pdf
15_flows_2_network_flows_1648282309846.pdf
15_flows_3_residual_networks_1648282310086.pdf
15_flows_4_maxflow_mincut_1648282310350.pdf
15_flows_5_ford_fulkerson_1648282310412.pdf
15_flows_6_example_1648282310812.pdf
15_flows_7_edmonds_karp_1648282311223.pdf
15_flows_8_bipartite_matching_1648282311708.pdf
15_flows_9_image_segmentation_1648282311845.pdf
Programming Assignment: Programming Assignment 1_1648282314067.pdf
16_LP_1_1_introduction_1648282314327.pdf
16_LP_1_2_LP_1648282314596.pdf
16_LP_2_1_Substitution_1648282314632.pdf
16_LP_2_2_GaussianElimination_1648282314669.pdf
16_LP_2_GaussianElimination_1648282314902.pdf
16_LP_3_Convexity_1648282315053.pdf
16_LP_4_1_Duality_1648282315174.pdf
16_LP_4_2_DualityProofs_1648282315307.pdf
16_LP_5_Formulations_1648282315553.pdf
16_LP_6_simplex_1648282315739.pdf
16_LP_7_ellipsoid_1648282315987.pdf
Programming Assignment: Programming Assignment 2_1648282316616.pdf
17_np_complete_problems_1_search_problems_1648282316847.pdf
17_np_complete_problems_2_reductions_1648282317099.pdf
Programming Assignment: Programming Assignment 3_1648282317784.pdf
18_coping_with_np_completeness_1_introduction_1648282318069.pdf
18_coping_with_np_completeness_2_special_cases_1648282318188.pdf
18_coping_with_np_completeness_3_exact_algorithms_1648282318450.pdf
18_coping_with_np_completeness_4_approximation_algorithms_1648282318739.pdf
Programming Assignment: Programming Assignment 4_1648282319830.pdf
Practice Programming Assignment: (Optional) Programming Assignment 5_1648282320366.pdf
week3_greedy_algorithms_1648282321234.pdf
week4_divide_and_conquer_1648282321599.pdf
week5_dynamic_programming1_1648282321750.pdf
week6_dynamic_programming2_1648282322144.pdf
09_graph_decomposition_1_basics_1648282323271.pdf
09_graph_decomposition_2_representations_1648282323490.pdf
09_graph_decomposition_3_explore_1648282323673.pdf
09_graph_decomposition_4_connectivity_1648282323982.pdf
09_graph_decomposition_5_pre-and-post-orders_1648282324126.pdf
09_graph_decomposition_6_dags_1648282325013.pdf
09_graph_decomposition_7_topological-sort_1648282325364.pdf
09_graph_decomposition_8_strongly-connected-components_1648282325514.pdf
09_graph_decomposition_9_computing-sccs_1648282325865.pdf
10_shortest_paths_in_graphs_1_bfs_1648282326376.pdf
10_shortest_paths_in_graphs_2_dijkstra_1648282327170.pdf
10_shortest_paths_in_graphs_3_bellman_ford_1648282327503.pdf
11_1_minimum_spanning_trees_1648282328120.pdf
19_advanced_shortest_paths_1_bidirectional_dijkstra_1648282328826.pdf
19_advanced_shortest_paths_2_A_star_1648282329378.pdf
19_advanced_shortest_paths_3_contraction_hierarchies_1648282330342.pdf
Practice Programming Assignment: Advanced Shortest Paths_1648282331699.pdf
Programming Assignment: Programming Assignment 1_1648282332316.pdf
Suffix-Trees-Reduced_1648282333684.pdf
BWT-Suffix-Arrays-Reduced_1648282335251.pdf
Programming Assignment: Programming Assignment 2_1648282335723.pdf
better_bwmatching_1648282335771.pdf
bwmatching_1648282335799.pdf
14_algorithmic_challenges_1_knuth_morris_pratt_1648282335993.pdf
14_algorithmic_challenges_2_suffix_array_1648282336242.pdf
14_algorithmic_challenges_3_from_suffix_array_to_suffix_tree_1648282336498.pdf
Programming Assignment: Programming Assignment 3_1648282336636.pdf
_61d056196c0646e8667f6765d9aa0f96_Programming-Assignment-1_1648282336942.pdf
_c9371d52e542255e07157e2c33819ca8_Programming-Assignment-2_1648282337247.pdf
_3534ea217849fead5923c07550874ab4_Programming-Assignment-3_1648282337416.pdf
_9e9dde3a6fc7020663126285ae606c07_Programming-Assignment-4_1648282337670.pdf