I have written some prototype Perl code that when given a set of bus routes will give a list of bus times for how to get from one point to another, including resolving of transfers. (This was written as a way to make sense of many different bus routes.)
Eventually I'll polish it up a bit and publish it on CPAN. In the meantime, what do I call it?
Something in the Algorithm::* namespace. It's a kind of best edge weights directed graph algorithm, though tailored for resolving transportation schedules.
Suggestions would be helpful.
Regards, Rob
