consider cooperative games with arbitrary graphs and construct rooted spanning trees by using the classical algorithms DFS and … BFS. If the graph is complete, we show that the compensation solutions associated with DFS and BFS coincide with the …