[GraphHopper] getting the list of sorted shortest path

[Alexandre Vallette]

thanks Peter,

is it because it is not implemented or because it's a core restriction from
contraction hierarchies?
Could a trick like changing the weight of an edge and redo the query could
do the trick?


On Fri, Jul 19, 2013 at 10:30 AM, Peter K <peathal at yahoo.de> wrote:

> Hi Alexandre,
>
> >1) So first, am i doing things right? I had to define a bijection
> because my vertices have id starting from 300000 and it seems that
> graphhopper creates all the intermediary vertices.
>
> Look good to me. Is everything working? Would be nice to have suche a
> snippet as a gist or in the wiki. Yes, graph and edge ids are starting
> from 0
>
> > 2) Second, how would it be possible to retrieve a list (or even a
> > stream) of the shortest paths between two nodes: the first being the
> > shortest, second shortest etc...
>
> It is not possible yet to get such a list with graphhopper. See this
> question: http://stackoverflow.com/q/12773525/194609
>
> Regards,
> Peter.
>
> _______________________________________________
> GraphHopper mailing list
> GraphHopper at openstreetmap.org
> http://lists.openstreetmap.org/listinfo/graphhopper
>



-- 
-- 
Dr Alexandre Vallette, PhD
SNIPS
co-founder

+ 33 (0) 6 71358943
alexandre.vallette at snips.net
skype: vallettea
linkedIn: fr.linkedin.com/in/vallettea/
twitter: @vallettea
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.openstreetmap.org/pipermail/graphhopper/attachments/20130719/72006565/attachment.html>