<div dir="ltr">Hi Peter ,<div><br></div><div>>>you will need to use a graph exploration algorithm like Dijkstra with a shortest weighting and specify the weight limit to the distance you want</div><div>How I will accomplish this for edgeiterator ?</div><div><br></div><div><br></div><div>I think its possible to query using GHQuery but needs the exact points , which doest comply to my problem statement...how do I find all roads from a point on  the road with x meters away and exact point on each of edges /connecting road after x meters </div><div><pre style="overflow:auto;font-family:Consolas,'Liberation Mono',Menlo,Courier,monospace;font-size:13.600001335144px;margin-top:0px;margin-bottom:0px;font-stretch:normal;line-height:1.45;padding:16px;border-radius:3px;word-wrap:normal;word-break:normal;color:rgb(51,51,51);background-color:rgb(247,247,247)"><span class="">GHRequest</span> req <span class="" style="color:rgb(167,29,93)">=</span> <span class="" style="color:rgb(167,29,93)">new</span> <span class="">GHRequest</span>(latFrom, lonFrom, latTo, lonTo)<span class="" style="color:rgb(0,134,179)">.</span>
    setWeighting(<span class="" style="color:rgb(24,54,145)"><span class="">"</span>fastest<span class="">"</span></span>)<span class="" style="color:rgb(0,134,179)">.</span>
    setVehicle(<span class="" style="color:rgb(24,54,145)"><span class="">"</span>car<span class="">"</span></span>);
<span class="">GHResponse</span> rsp <span class="" style="color:rgb(167,29,93)">=</span> hopper<span class="" style="color:rgb(167,29,93)">.</span>route(req);</pre></div><div class="gmail_extra"><br><div class="gmail_quote">My Code </div><div class="gmail_quote"><br></div><div class="gmail_quote"><div class="gmail_quote">EdgeIteratorState edge = qr.getClosestEdge();</div><div class="gmail_quote">        ShortestWeighting shortestWeighting=   new ShortestWeighting() ;</div><div class="gmail_quote">        shortestWeighting.getMinWeight(distance)</div><div class="gmail_quote">        Dijkstra dijkstra=    new Dijkstra(hopper.getGraph(),encodingManager.getSingle(),new ShortestWeighting());</div><div class="gmail_quote">        EdgeIterator edgeIterator= edx.setBaseNode(edge.getBaseNode());</div><div class="gmail_quote">     //   edgeIterator.</div><div class="gmail_quote"><br></div><div class="gmail_quote">        edgeIterator.setDistance(distance);</div><div class="gmail_quote">        while (edgeIterator.next()){</div><div class="gmail_quote"><br></div><div class="gmail_quote">            int edgeNo=    edgeIterator.getAdjNode();</div><div class="gmail_quote">        Path path= dijkstra.calcPath(edge.getBaseNode(), edgeNo)  ;</div><div class="gmail_quote">            data.add(edgeNo)  ;</div><div class="gmail_quote">            </div><div class="gmail_quote">            _<a href="http://logger.info">logger.info</a>(" Adjacent Edge : "+path.getDistance());</div><div class="gmail_quote"><br></div><div class="gmail_quote">        }</div></div><div class="gmail_quote">I hope its possible , I have tried many approaches they solve only one part of problem </div><div class="gmail_quote"><br></div><div class="gmail_quote">Regards ,</div><div class="gmail_quote">G</div><div class="gmail_quote"><br></div><div class="gmail_quote">On Fri, Mar 6, 2015 at 12:54 PM, Peter <span dir="ltr"><<a href="mailto:graphhopper@gmx.de" target="_blank">graphhopper@gmx.de</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left-width:1px;border-left-color:rgb(204,204,204);border-left-style:solid;padding-left:1ex">
  
    
  
  <div text="#000000" bgcolor="#FFFFFF"><span class="">
    <div>On 06.03.2015 07:13, Gp P wrote:<br>
    </div>
    <blockquote type="cite">
      <div>As you can see above , i trying get all edges with distance </div>
    </blockquote>
    <br></span>
    you will need to use a graph exploration algorithm like Dijkstra
    with a shortest weighting and specify the weight limit to the
    distance you want<br>
    <br>
    <div>> edgeIterator.setDistance(<b>distance</b>);<br>
      <br>
      oh, that should throw an exception if called before 'next' as this
      sets the distance for one specific edge not for the iterator<span class=""><font color="#888888"><br>
      <br>
      Peter<br>
    </font></span></div>
    <br>
  </div>

<br>_______________________________________________<br>
GraphHopper mailing list<br>
<a href="mailto:GraphHopper@openstreetmap.org">GraphHopper@openstreetmap.org</a><br>
<a href="https://lists.openstreetmap.org/listinfo/graphhopper" target="_blank">https://lists.openstreetmap.org/listinfo/graphhopper</a><br>
<br></blockquote></div><br><br clear="all"><div><br></div>-- <br><div class="gmail_signature"><font color="#999999"><font face="verdana, sans-serif"><font size="4" style="font-weight:bold">B</font><b>e </b> the</font><font face="verdana, sans-serif"><font size="4"> </font><font size="4"><b>Ch</b>ange</font></font></font></div>
</div></div>