RFayez / Intro-to-Algorithms

Udacity CS 215

Udacity CS 215: Intro to Algorithms.

Usage

$ python file_name.py

Problem Set 1

1. create_graph_with_eulerian_tour.py
2. general_clique.py
3. challenge_find_eulerian_tour.py

Problem Set 2

1. make_a_combination_lock.py

Lesson 3

1. checking_pairwise_connectivity.py

Problem Set 3

1. mark_component.py
2. centrality.py

Lesson 4

1. remove_min.py

Problem Set 4

1. minimize_sum_of_absolute_value.py
2. minimize_sum_of_squares.py
3. mode.py
4. up_heapify.py
5. actor_centrality.py imdb-1.tsv

Lesson 5

1. strength_of_connections.py marvel-graph.tsv
2. randomizing_clustering_coefficient.py

Problem Set 5

1. implementing_dijkstra_with_heaps.py
2. least_obscure_path.py imdb-1.tsv imdb-weights.tsv

Lesson 6

1. tetristan.py
2. reduction_long_and_simple_path.py
3. solving_3_colorability.py

Problem Set 6

1. programming_in_reduction.py
2. reduction_k_clique_decision.py
3. polynomial_vs_exponential.py

Final Assessment

1. bipartite.py
2. feel_the_love.py
3. weighted_graph.py smallG.pkl smallChr.pkl
4. finding_the_best_flight.py (not accepted by grader)
5. constantly_connected.py
6. distance_oracle_1.py
7. distance_oracle_2.py
8. finding_a_favor.py heap.py

Extra Challenge Problems

1. top_two.py