COLLABORATORS: hiranumn, lanea, cookb

I'm quite certain that this was probably one of the hardest problems to conceptu
alize ever.
I swear to god that the three of us whiteboarded for upwards of 4 hours, so I ha
ve no idea
who really said what anymore. But I remember that we discussed that we needed to
figure out
how to apply the FF algorithm to the flight schedules, and the tricky part was s
etting up
arrival times and departure times in such a way that they worked to create a val
id network.
Obviously our running time bottleneck would then be the FF algorithm. cookb came
up with the
infinite capacity edge thing.