Hi guys so I have this problem and need to find a proof. There is tennis tournament where we have n players. Every player plays match with every other player. We create graph where nodes are players and edges are made from player who won to player who lost. I need to prove that there is path in this graph that is n-1 edges long. But how?