Question: Repeat Exercise for the following network of roads.
Exercise: The diagram represents a system of roads from A to B. The mayor of town A wishes to send a message to the mayor of town B, and since all other means of communication are tapped, he sends out a certain number of trusted individuals on foot. If all paths taken by the individuals are to be disjoint, how many messengers can he employ?
