Shortest travel times from a start node to target nodes
A weighted graph models a road map. Given a start node and one or more target nodes, return the shortest travel time (an ETA) from the start to each target. Use Dijkstra's algorithm with a heap, and say how you would stop early or handle unreachable targets.
No answer yet. Write the first one; the best answer gets endorsed.