Your question is Dynamic Routing with Dijkstra or A*. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
Solve a classic graph traversal problem, such as Dijkstra’s or A*, modified to handle dynamic road closures and traffic delays for Vorto’s dispatching.