On 06.03.2015 07:13, Gp P wrote: > As you can see above , i trying get all edges with distance
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 > edgeIterator.setDistance(*distance*); oh, that should throw an exception if called before 'next' as this sets the distance for one specific edge not for the iterator Peter
_______________________________________________ GraphHopper mailing list [email protected] https://lists.openstreetmap.org/listinfo/graphhopper
