i wonder if it is possible to implement weight in path searching algorithm
(e.g. k-shortest paths) in the way that
weight of actual edge would depend on the attribute of previous edge when
algorithm is constructing path.
More specifically : I am implementing bus routing.
I putted all locations,connections,timetables together and i created graph
and shortest and k-shortest paths are
searched fine BUT thing about what happens when you change bus in some
location - you usually wait for some
time for connecting bus and amount(weight) of this time depends on previous
bus connection and on connecting
bus line -> that`s what concerns me.
For sure i can use unweighted graph, algorithm will tell me what`s best way
in given topology and in some "post-process" i will compute precise timings
for shortest and k-shortest bus paths, BUT this is not so elegant solution.
Any ideas / hints ?
Get latest updates about Open Source Projects, Conferences and News.