Suppose Station A has neighbours B and C. There are two ways to get from A to C. 1. Take a bus directly from A to C, arriving at 12:30pm. 2. Take a bus from A to B, then from B to C, arriving at 12:10pm. So my question is, if station A finds that station C is a direct neighbour, should it return the fastest direct journey to station C? (Return journey 1) Or should it probe its other neighbours to see if any other station has a faster indirect journey to station C? (Return journey 2)

On the Clarifications page: "The fastest journey to a destination (from 'now') is one that arrives at the destination soonest, independent of when it starts."

That clarification would suggest that Path 2 would be chosen for arriving at the final destination sooner, but the line in the clarifications on the 5th of May was what confused me. It says "Your query should be made directly to the server of station-A, and need to provide station-B and time-T (the inputs). If station-A is directly connected to station-B, station-A can get the answer from its own timetable, and immediately reply with:" I understood this as saying that if the destination is its neighbour, the result will be immediately returned without considering any other paths. Which would imply that Path 1 is the chosen one.

I am also confused about the exact same thing.

Also confused by this contradiction

Should we disregard the project brief information of returning the direct route and follow this clarification instead? The idea that the route required is just the fastest to arrive at the destination? Thanks