<html>
  <head>
    <meta content="text/html; charset=ISO-8859-1"
      http-equiv="Content-Type">
  </head>
  <body bgcolor="#FFFFFF" text="#000000">
    <div class="moz-cite-prefix">Returning such a list isn't that easy.
      How do you define "second shortest" path etc? At least several
      routes won't makes sense - you'll get routes with senseless
      detours in it etc<br>
      <br>
      > Could a trick like changing the weight of an edge and redo
      the query could do the trick?<br>
      <br>
      Not sure. Changing edge weights in the contracted graph is not
      that easy.<br>
      <br>
      What you could do is to listen for new events under
      algo.updateShortest (or algo.checkFinishCondition) and collect the
      found paths (and sort them):<br>
<a class="moz-txt-link-freetext" href="https://github.com/graphhopper/graphhopper/blob/19310dc5a3f0b65df687d8157c2901b1fe115b4e/core/src/main/java/com/graphhopper/routing/DijkstraBidirectionRef.java#L185">https://github.com/graphhopper/graphhopper/blob/19310dc5a3f0b65df687d8157c2901b1fe115b4e/core/src/main/java/com/graphhopper/routing/DijkstraBidirectionRef.java#L185</a><br>
      <br>
      Regards,<br>
      Peter.<br>
      <br>
    </div>
    <blockquote
cite="mid:CAC0z2bQ7xdys68JaewMPEoFmP3kPhqJ7xLwbdq3TbEGH924Q6g@mail.gmail.com"
      type="cite">
      <div dir="ltr">thanks Peter,
        <div><br>
        </div>
        <div>is it because it is not implemented or because it's a core
          restriction from contraction hierarchies?</div>
        <div>Could a trick like changing the weight of an edge and redo
          the query could do the trick?</div>
      </div>
      <div class="gmail_extra"><br>
        <br>
        <div class="gmail_quote">On Fri, Jul 19, 2013 at 10:30 AM, Peter
          K <span dir="ltr"><<a moz-do-not-send="true"
              href="mailto:peathal@yahoo.de" target="_blank">peathal@yahoo.de</a>></span>
          wrote:<br>
          <blockquote class="gmail_quote" style="margin:0 0 0
            .8ex;border-left:1px #ccc solid;padding-left:1ex">
            Hi Alexandre,<br>
            <div class="im"><br>
              >1) So first, am i doing things right? I had to define
              a bijection<br>
              because my vertices have id starting from 300000 and it
              seems that<br>
              graphhopper creates all the intermediary vertices.<br>
              <br>
            </div>
            Look good to me. Is everything working? Would be nice to
            have suche a<br>
            snippet as a gist or in the wiki. Yes, graph and edge ids
            are starting<br>
            from 0<br>
            <div class="im"><br>
              > 2) Second, how would it be possible to retrieve a
              list (or even a<br>
              > stream) of the shortest paths between two nodes: the
              first being the<br>
              > shortest, second shortest etc...<br>
              <br>
            </div>
            It is not possible yet to get such a list with graphhopper.
            See this<br>
            question: <a moz-do-not-send="true"
              href="http://stackoverflow.com/q/12773525/194609"
              target="_blank">http://stackoverflow.com/q/12773525/194609</a><br>
            <br>
            Regards,<br>
            Peter.<br>
          </blockquote>
        </div>
      </div>
    </blockquote>
    <br>
  </body>
</html>