<div dir="ltr">New screenshot:<br><br></div><div class="gmail_extra"><br><br><div class="gmail_quote">2013/12/19 Andreas Fischer <span dir="ltr"><<a href="mailto:fischer.andreas.atf@googlemail.com" target="_blank">fischer.andreas.atf@googlemail.com</a>></span><br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir="ltr"><div><div>1000x Thanks!!! <br><br></div><div class="im">This solved the problem as you said:<br><br>EdgeExplorer ee = graph.createEdgeExplorer(edgeFilter);<br>
ee.setBaseNode(nodeID);<br>
<br></div>while(ee.next()){<br>
resultSet.add(graph.getEdgeProps(ee.getEdge(), ee.getAdjNode()));<br>}<br><br><br></div><div>The only thing is that i still have no street names on all roads. I would have checked the OSM ways for a streetname, but in my screenshot you can see, that some edges are purple which means that it has a name and doesn't has a name at the same time!<div class="im">
<br>
<br>> what are you trying to solve? I'm not sure I can follow you as
this all is already implemented in GraphHopper ...<br></div></div><div>I simply try to get all edges that are in my direct environment.<br><br></div><div class="im"><div>> Using the latest version would give you GPS exact results and we
make sure no other (already solved) problems are involved.<br></div></div><div>It is not easy to update to the latest version, since i changed essential things to achieve my goals.<br><br></div><div>Regards,<br>Andreas<br>
</div></div><div class="HOEnZb"><div class="h5"><div class="gmail_extra"><br><br><div class="gmail_quote">2013/12/16 Peter K <span dir="ltr"><<a href="mailto:peathal@yahoo.de" target="_blank">peathal@yahoo.de</a>></span><br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<div><br>
> Maybe i understand the problem... Could it be that an edge explorer<br>
> only iterates over edges of which the base node is the base node?<br>
> Makes sense somehow.<br>
> Now is the problem: How can i find an edge to which a given node is<br>
> the adjacent node?<br>
<br>
</div>Not sure if I understand completely. Maybe the problem you are having is<br>
that with CH a node is only connected to nodes with a higher level but<br>
still you should get all edges. And since you don't want shortcut edges<br>
this cannot be the problem. Hmmh.<br>
<br>
Or maybe the API is unclear? 'base' and 'adjacent' node is dependent of<br>
how you traverse the graph, not e.g. if this direction is accessible for<br>
car. E.g. if you have a simple graph '1-2-3' and you do<br>
<br>
iter = explorer.setBaseNode(1)<br>
while(iter.next()) {<br>
edgeIds.add(iter.getEdge());<br>
}<br>
=> you'll only get one edge id with adjacent node '2'<br>
<br>
iter = explorer.setBaseNode(2)<br>
while(iter.next()) {<br>
edgeIds.add(iter.getEdge());<br>
}<br>
=> you'll get two edge ids with adjacent node '1' and '3' where the<br>
order is not defined<br>
<br>
Regards,<br>
Peter.<br>
<div><div><br>
_______________________________________________<br>
GraphHopper mailing list<br>
<a href="mailto:GraphHopper@openstreetmap.org" target="_blank">GraphHopper@openstreetmap.org</a><br>
<a href="https://lists.openstreetmap.org/listinfo/graphhopper" target="_blank">https://lists.openstreetmap.org/listinfo/graphhopper</a><br>
</div></div></blockquote></div><br></div>
</div></div></blockquote></div><br></div>