Hi Falk, with the lower level API you have access to the nodeIds which are already tower nodes: path.calcEdges -> adjNode and baseNode
> 2. A little off topic: Is there a way to tag those nodes, persist and read those tags later, when calculating new routes? You will have to store the tags per nodeID while import into a separate storage like MapDB. I've done a similar thing already but yet integrated. Regards, Peter On 23.04.2015 17:38, Falk Morus wrote: > Hi, > I'm implementing an algorithm, which has to look for certain > information on every junction node within a calculated route. > Currently I'm following the git tutorial: > > QueryResult from, QueryResult to, QueryGraph, Path = > Dijkstra().calcPath() > > But the result set I got seems to have all nodes in it. NodeAccess > does not seem to have any flag to distinguish between node kinds. So: > > 1. Is there a way, to get only tower ( = junction/intersection) nodes > of a route (which I presume are already used for routing)? > 2. A little off topic: Is there a way to tag those nodes, persist and > read those tags later, when calculating new routes? > > Thanks in advance. > Sincerely, Falk > > _______________________________________________ > GraphHopper mailing list > [email protected] > https://lists.openstreetmap.org/listinfo/graphhopper _______________________________________________ GraphHopper mailing list [email protected] https://lists.openstreetmap.org/listinfo/graphhopper
