This algorithm will query the transit API given locations along the diagonal between the input start and end locations. It will calculate 2 points along the diagonal (1 close to start, 1 close to end) and then query the transit API 3 times: (1) start to point close to end, (2) point close to start to end, (3) between both points that are close to start/end. Finally it will choose 2 of the most promising returned transit routes (out of the 10 or so returned) and run the SimpleComboAlgorithm on them. The most promising routes will be choosen as those with the minimal time in transit (i.e. on bus) but if there is a tie it will revert to using total travel time (which includes walking).
Completed. Everyone please bang on the app as much as possible because this algorithm was very tricky to implement and is quite complex so it may still have bugs.
This algorithm will query the transit API given locations along the diagonal between the input start and end locations. It will calculate 2 points along the diagonal (1 close to start, 1 close to end) and then query the transit API 3 times: (1) start to point close to end, (2) point close to start to end, (3) between both points that are close to start/end. Finally it will choose 2 of the most promising returned transit routes (out of the 10 or so returned) and run the SimpleComboAlgorithm on them. The most promising routes will be choosen as those with the minimal time in transit (i.e. on bus) but if there is a tie it will revert to using total travel time (which includes walking).