Bard College – Computer Science – Data Structures
In this lab, we will explore undirected graphs using the book's IMDB actor-movie dataset. Specifically, we will investigate degrees of separation(pg. 555) between actors and movies. You can download a utf-8 converted file from Moodle, also the separator has been changed to"="(rather than"/").
Questions
For each question, supply an answer along with an explanation of how you arrived at that answer.
Co-Stars. Find all the actors who have co-starred with Kevin Bacon at least twice. What pair of actors has co-starred most often?
Center of the Hollywood universe. We can measure how good of a center that Kevin Bacon is by computing their Hollywood number. The Hollywood number of Kevin Bacon is the average Bacon number of all the actors. The Hollywood number of another actor is computed the same way, but we make them be the source instead of Kevin Bacon. Consider only actors in Kevin Bacon’s connected component(if/when your DFS runs out of stack space, consider using an explicit stack rather than the call stack, i.e., modify the bfs method to use a Stack rather than a Queue). Compute Kevin Bacon's Hollywood number and find an actor and actress with better Hollywood numbers."(FromSedgewick and Wayne)
Discover something else interesting about Hollywood using this data set.
Submission
By May 18th, submit via moodle as a zipped folder:
Questions
Submission
lab11.pdf .java files of any supporting code