If you were required by a professor to find a spanning tree of the movie collaboration graph (where each node corresponds to an actor with finite Kevin Bacon number, and two nodes are connected by an edge if the corresponding actors have been in a movie together), how would you do it? Why would you choose your method over other possible methods?
Analysis: At the first step, you need to form this graph,
say G=(V,E), then we can use the following method to get a spanning tree. We assume that G ...
The strategy for finding a spanning tree based on the Kevin Bacon movie collaboration game is outlined.