  We study parameterized versions of classical algorithms for computing
shortest-path trees. This is most easily expressed in terms of tropical
geometry. Applications include shortest paths in traffic networks with variable
link travel times.
