Skip to main content

New answers tagged

2 votes

Shortest path between two nodes with time-dependent edge weights

You need to build a bigger graph (a "product graph", in the jargon). Each vertex is identified by a pair $(V,t)$, where $V$ is a location (a point on the map where two road segments join) ...
D.W.'s user avatar
  • 161k
2 votes

Shortest path between two nodes with time-dependent edge weights

Instead of having the vertices in your navigation graph defined by only the location you can have vertices defined by location and time. That way the result of $cost((V1, t), V2)$ will depend on time ...
ratchet freak's user avatar

Top 50 recent answers are included