"Tom Anderson" <[EMAIL PROTECTED]> wrote in message news:[EMAIL PROTECTED] > On Sat, 16 Jul 2005, Joseph Garvin wrote: > >> Someone correct me if I'm wrong -- but isn't this the Shortest Path >> problem? > > Dang! I was just about to point that out.
One twist is that it is not the shortest path to one node or all nodes but to a set of nodes (the destination on any of several days). > I can't immediately see any properties of this network that could be > exploited, but that doesn't mean there aren't any. No it doesn't. The challenge is to find a property that saves more time, across trials, that it takes to compute. Terry J. Reedy -- http://mail.python.org/mailman/listinfo/python-list