Data

Tools

Indexes

Applications

Experiments

Awesome

An open API service indexing awesome lists of open source software.

https://github.com/viniciusfinger/harvard-cs50ai-six-degrees-problem

According to the Six Degrees of Kevin Bacon, anyone in the Hollywood can be connected to Kevin Bacon within six steps. In this problem, we’re interested in finding the shortest path between any two actors by choosing a sequence of movies that connects actors.
https://github.com/viniciusfinger/harvard-cs50ai-six-degrees-problem

artificial-intelligence graph graph-algorithms harvard harvardcs50

Last synced: 4 days ago
JSON representation

According to the Six Degrees of Kevin Bacon, anyone in the Hollywood can be connected to Kevin Bacon within six steps. In this problem, we’re interested in finding the shortest path between any two actors by choosing a sequence of movies that connects actors.

Awesome Lists containing this project

README 

          
# Hollywood Six Degrees - CS50's IA Project 1 🍿📽️



-------



Write a program that determines how many “degrees of separation” apart two actors are.



```

$ python degrees.py large

Loading data...

Data loaded.

Name: Emma Watson

Name: Jennifer Lawrence

3 degrees of separation.

1: Emma Watson and Brendan Gleeson starred in Harry Potter and the Order of the Phoenix

2: Brendan Gleeson and Michael Fassbender starred in Trespass Against Us

3: Michael Fassbender and Jennifer Lawrence starred in X-Men: First Class



```



When to Do It

-------------



By [2024-12-31T23:59:00-05:00](https://time.cs50.io/20241231T235900-0500)



How to Get Help

---------------



1.  Ask questions via [Ed](https://cs50.edx.org/ed)!

2.  Ask questions via any of CS50’s [communities](https://cs50.harvard.edu/ai/2024/communities/)!



Background

----------



According to the [Six Degrees of Kevin Bacon](https://en.wikipedia.org/wiki/Six_Degrees_of_Kevin_Bacon) game, anyone in the Hollywood film industry can be connected to Kevin Bacon within six steps, where each step consists of finding a film that two actors both starred in.



In this problem, we’re interested in finding the shortest path between any two actors by choosing a sequence of movies that connects them. For example, the shortest path between Jennifer Lawrence and Tom Hanks is 2: Jennifer Lawrence is connected to Kevin Bacon by both starring in “X-Men: First Class,” and Kevin Bacon is connected to Tom Hanks by both starring in “Apollo 13.”



We can frame this as a search problem: our states are people. Our actions are movies, which take us from one actor to another (it’s true that a movie could take us to multiple different actors, but that’s okay for this problem). Our initial state and goal state are defined by the two people we’re trying to connect. By using breadth-first search, we can find the shortest path from one actor to another.



Getting Started

---------------



*   Download the distribution code from [https://cdn.cs50.net/ai/2023/x/projects/0/degrees.zip](https://cdn.cs50.net/ai/2023/x/projects/0/degrees.zip) and unzip it.



Understanding

-------------



The distribution code contains two sets of CSV data files: one set in the `large` directory and one set in the `small` directory. Each contains files with the same names, and the same structure, but `small` is a much smaller dataset for ease of testing and experimentation.



Each dataset consists of three CSV files. A CSV file, if unfamiliar, is just a way of organizing data in a text-based format: each row corresponds to one data entry, with commas in the row separating the values for that entry.



Open up `small/people.csv`. You’ll see that each person has a unique `id`, corresponding with their `id` in [IMDb](https://www.imdb.com/)’s database. They also have a `name`, and a `birth` year.



Next, open up `small/movies.csv`. You’ll see here that each movie also has a unique `id`, in addition to a `title` and the `year` in which the movie was released.



Now, open up `small/stars.csv`. This file establishes a relationship between the people in `people.csv` and the movies in `movies.csv`. Each row is a pair of a `person_id` value and `movie_id` value. The first row (ignoring the header), for example, states that the person with id 102 starred in the movie with id 104257. Checking that against `people.csv` and `movies.csv`, you’ll find that this line is saying that Kevin Bacon starred in the movie “A Few Good Men.”



Next, take a look at `degrees.py`. At the top, several data structures are defined to store information from the CSV files. The `names` dictionary is a way to look up a person by their name: it maps names to a set of corresponding ids (because it’s possible that multiple actors have the same name). The `people` dictionary maps each person’s id to another dictionary with values for the person’s `name`, `birth` year, and the set of all the `movies` they have starred in. And the `movies` dictionary maps each movie’s id to another dictionary with values for that movie’s `title`, release `year`, and the set of all the movie’s `stars`. The `load_data` function loads data from the CSV files into these data structures.



The `main` function in this program first loads data into memory (the directory from which the data is loaded can be specified by a command-line argument). Then, the function prompts the user to type in two names. The `person_id_for_name` function retrieves the id for any person (and handles prompting the user to clarify, in the event that multiple people have the same name). The function then calls the `shortest_path` function to compute the shortest path between the two people, and prints out the path.



The `shortest_path` function, however, is left unimplemented. That’s where you come in!



Specification

-------------



Complete the implementation of the `shortest_path` function such that it returns the shortest path from the person with id `source` to the person with the id `target`.



*   Assuming there is a path from the `source` to the `target`, your function should return a list, where each list item is the next `(movie_id, person_id)` pair in the path from the source to the target. Each pair should be a tuple of two strings.

    *   For example, if the return value of `shortest_path` were `[(1, 2), (3, 4)]`, that would mean that the source starred in movie 1 with person 2, person 2 starred in movie 3 with person 4, and person 4 is the target.

*   If there are multiple paths of minimum length from the source to the target, your function can return any of them.

*   If there is no possible path between two actors, your function should return `None`.

*   You may call the `neighbors_for_person` function, which accepts a person’s id as input, and returns a set of `(movie_id, person_id)` pairs for all people who starred in a movie with a given person.



You should not modify anything else in the file other than the `shortest_path` function, though you may write additional functions and/or import other Python standard library modules.



Hints

-----



*   While the implementation of search in lecture checks for a goal when a node is popped off the frontier, you can improve the efficiency of your search by checking for a goal as nodes are added to the frontier: if you detect a goal node, no need to add it to the frontier, you can simply return the solution immediately.

*   You’re welcome to borrow and adapt any code from the lecture examples. We’ve already provided you with a file `util.py` that contains the lecture implementations for `Node`, `StackFrontier`, and `QueueFrontier`, which you’re welcome to use (and modify if you’d like).



Testing

-------



If you’d like, you can execute the below (after [setting up `check50`](https://cs50.readthedocs.io/projects/check50/en/latest/index.html) on your system) to evaluate the correctness of your code. This isn’t obligatory; you can simply submit following the steps at the end of this specification, and these same tests will run on our server. Either way, be sure to compile and test it yourself as well!



```

check50 ai50/projects/2024/x/degrees



```



Execute the below to evaluate the style of your code using `style50`.



How to Submit

-------------



1.  Visit [this link](https://submit.cs50.io/invites/d03c31aef1984c29b5e7b268c3a87b7b), log in with your GitHub account, and click **Authorize cs50**. Then, check the box indicating that you’d like to grant course staff access to your submissions, and click **Join course**.

2.  [Install Git](https://git-scm.com/downloads) and, optionally, [install `submit50`](https://cs50.readthedocs.io/submit50/).

3.  If you’ve installed `submit50`, execute

    

    ```

submit50 ai50/projects/2024/x/degrees



```



    

    Otherwise, using Git, push your work to `https://github.com/me50/USERNAME.git`, where `USERNAME` is your GitHub username, on a branch called `ai50/projects/2024/x/degrees`.

    



Work should be graded within five minutes. You can then go to [https://cs50.me/cs50ai](https://cs50.me/cs50ai) to view your current progress!



Acknowledgements

----------------



Information courtesy of [IMDb](https://www.imdb.com/). Used with permission.