The idea is you have a graph, where, the vertices are actors, and the edge, and think of an edge connecting two actors, if they are in a movie together. and so what you wabt to find is given an actor how, what's the shortest way to get to Kevin Bacon, connected by, so, edges were actors and edges were movies, In connection of actors in the movie. 