Editing 2015 Jan Bronze Problem 4 Meeting Time (section)

== Solution ==

We solve this problem by calculating the shortest times from each pasture to the meeting pasture for both Bessie and Elsie. Then, for each pair of starting pastures, we calculate the meeting time by taking the maximum of the two times, and we keep track of the minimum meeting time across all pairs of starting pastures.

For calculating the shortest times, we can use the Floyd-Warshall algorithm. The Floyd-Warshall algorithm works by repeatedly iterating over all pairs of nodes and attempting to improve the shortest path between them by including a third node.

Finally, after we have calculated the shortest times for both Bessie and Elsie, we iterate over all pairs of starting pastures and calculate the meeting time. The meeting time is simply the maximum of the two times, since they leave simultaneously and the meeting cannot start until both have arrived. We keep track of the minimum meeting time across all pairs of starting pastures, and this is our answer.