"Six Degrees of Kevin Bacon" is a parlor game based on the "six degrees of separation" concept.
The idea of the game "Six Degrees of Kevin Bacon" is to connect an actor to Kevin Bacon through a trail of actors who appeared together in movies, and do so in less than six steps. The game is really a graph problem. If you assign each actor to a vertex, and add an edge between two actors if they have appeared together in a movie, then you have a graph that represents the data for this game. Then the problem of finding a trail of actors to Kevin Bacon becomes a traditional graph problem: that of finding a path between two vertices. Since we wish to find a path that is shorter than six steps, ideally we would find the shortest path between the vertices.
