Question 8
The beaver kingdom consists of six islands: A, B, C, D, E and F. A strange disease has appeared on island F, and the king needs to send experts from island A to help island F. To prevent the disease from spreading, however, the king also restricts travel between the islands as shown below.
Travel must follow the arrows. Furthermore, the number of people allowed on each route is limited. Each number in the diagram is the maximum number of people permitted to travel along that route in one day.
What is the maximum number of experts who can reach island F on the first day?
Travel must follow the arrows. Furthermore, the number of people allowed on each route is limited. Each number in the diagram is the maximum number of people permitted to travel along that route in one day.
What is the maximum number of experts who can reach island F on the first day?