Fastest trip when two travellers may meet and ride together
Two people start at different nodes of a graph and both need to reach the same destination. They may travel separately, or meet at some node and take the bus together from there. Return the least total time (or steps). Represent the graph however you like; run searches from both starts and the destination and combine them.
GoogleTechnical phone screenNo answer yet. Write the first one; the best answer gets endorsed.