Hi all, I’m doing a quick lit review.
Consider I have a graph that has link weights dependent on time. I.e., a bus on this road gives a journey time (link weight) of x at time y. This is a classic public transport shortest path problem. This is a weighted directed graph that is time dependent. Are there any resources relating to a shortest path algorithm for such a graph? I suspect someone may have done this using GTFS data in some way Cheers Geroid --------------------------------------------------------------------- To unsubscribe e-mail: user-unsubscr...@spark.apache.org
