3

I'm working on a shapefile of Brussels (QGIS 3). This shapefile contains all the streets in Brussels, see below.

example1

With the attribute table, I have an "X" and "Y" position for each line (debut and end),

example2

I used this to create nodes at each debut and end of the line in Oracle Spatial.

example3 example4

Now I need to check if

  • all the nodes are not in double
  • They are all connected to another
  • There isn't one node so close to another that a travelling test would take the wrong way

EDIT :

For now I'm just Using the network analasys from Processing Tools, and I take one node on the left and one on the right (then N and S etc) and ask for the shortest path to see if it's OK. But There should be an easiest way that provides to do an analysis on all the Network !

==> SO I'm looking for - a way to calculate a lot of shortest path easily (maybe with a script) or - another way to see if each point is really connected to the rest.

Maybe I could take a point in the center and test it with all of the point on the external (like the boarder of my shp?)

enter image description here enter image description here

  • @Cyril , Done ! – Svhooren Sep 18 at 13:49
  • 1
    Was your issue resolved? If yes, please put those edits as an answer. – Taras Sep 20 at 5:18
  • @Taras No it is not, I would like to test a lot of shortest path with a script or something, I'll edit my title ! – Svhooren Sep 20 at 7:01
  • @Taras I changed title and edit again my question – Svhooren Sep 20 at 7:06
  • Are you aware that if you ask for a script solutions your question can be easily put on hold in case if you do not show any code attempts? – Taras Sep 20 at 7:20

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.