ConceptTheory & Algos
Time-dependent shortest path
A shortest path problem where edge weights (time costs) vary depending on the time of day a traveler enters the edge.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.