OutForAWalk.java

Given a layout of a building (as a connected graph of course), the program determines the maximum effort that a person has to endure in order for him to go from the source vertex to the destination vertex (the edge with maximum weight along the easiest path). The person is not in rush. He can take a longer path (detour, etc) as long as his maximum effort that he has to endure along that path is minimized.