[GraphHopper] Questions about Graph and Path

[Peter]

Hi,

re: 1) yes it is possible, but you'll have to keep multiple threads in
mind. You can set the edge flags to a different value
re: 2) see the PathMerger class, splitting has to be done manually.
Shouldn't be hard

Note: if you need this for alternate routes, you can just lean back and
wait as we are working on a solution in the next weeks giving you more
realistic alternatives.

Regards,
Peter.

On 25.11.2014 13:46, Account Università Villa Luca wrote:
> Hello,
> I wanted to develop a multiple path algorithm to find the k-shortest
> paths in a graph, more precisely the  Jin Y. Yen's algorithm to find
> the k shortest loopless paths in a network. For that I needed to ask
> some questions about Graphhopper:
> 1) In the algorithm, it's required to modify the weights of the edges
> of the underlying graph, then, after having calculated the k-path from
> the (k-1)-path, revert them back to the original costs. Is it possible?
>
> 2) Another question is if it's possible to concatenate two paths where
> one has the same origin node of the other's destination node.
> Conversely, if a path can be split in two paths on a node.
>
> Thanks.
>
> _______________________________________________
> GraphHopper mailing list
> GraphHopper at openstreetmap.org
> https://lists.openstreetmap.org/listinfo/graphhopper