← Questions
Shortest travel times from a start node to target nodes
0
I was asked this
No reports yet. Sign in to say where you were asked it.
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 official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding