[GraphHopper] getting the list of sorted shortest path

[Peter K]

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.