Find shortest/fastest path between two points. Basic: Dijkstra's algorithm. Optimization: A* with heuristic. At scale: precompute hierarchical shortcuts (Contraction Hierarchies).
Road network as graph: intersections = nodes, roads = edges with weights (distance, time). Weight updates for traffic. Turn restrictions add complexity. Multi-modal: driving, walking, transit require different graphs.