New here, and not so clear on how sets work yet..

I'm requesting a bunch of ways, and the nodes within these. For each node I'd like to find the other nodes which are connected via a way as kindly demonstrated here, https://help.openstreetmap.org/questions/71493

However, I was hoping for a way to call this on multiple nodes, but having someway of knowing which nodes neighbour which, as opposed to receiving a large set of unordered nodes for the whole group.

Ultimately, in my application, I'm looking to create an array, neighbours[node], which contains a vector of reachable nodes from the said node.

Ideally this will also be filtered this so that it incorporates the oneway tag in regards which nodes are "reachable", i.e.

neighbours[A] = BC while neighbours[C] = nil if nodes ABC make up a one way street or roundabout sequence of ways.

Is there any way to do this in a single request which will return some nested or ordered format containing nodes with their neighbours, or does it have to be done with an individual request for each node in order to fill out my array?

Thanks

asked 13 Jul, 20:54

mugwort's gravatar image

mugwort
112
accept rate: 0%

Be the first one to answer this question!
toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here

By RSS:

Answers

Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported

Question tags:

×445
×187
×28
×2

question asked: 13 Jul, 20:54

question was seen: 115 times

last updated: 13 Jul, 20:54

powered by OSQA