Problem 3604 · Medium

Minimum Time to Reach Destination in Directed Graph

Earliest-arrival Dijkstra on time-windowed edges: wait at a node until an edge opens, then cross in one second.

Open the interactive visualisation