Route Finding

A number of companies on the web make their money by advertising on cites that produce driving directions for any two points in the US.

Simple version of the problem: map is a weighted directed graph G=(V,E), w.

Nodes are places and intersections, edges are roads, weights are driving times (factoring in distance, road size, expected traffic).


next up previous
Next: Single-Source Shortest-Path Problem Up: SHORTEST PATH PROBLEM Previous: SHORTEST PATH PROBLEM