1

Topic: Algorithm to find the maximum quantity of players that concerned a ball

Greetings! Help cotton velvet with idea for the following task: there is a group of players. If two players see each other they can pass a ball each other. How to find the maximum quantity of players which can concern a ball. Each player can concern a ball an unlimited number of times. For each player it is given whom it sees. What structure to use for players. Thanks for ideas