Thanks Michael and Craig,
1)Done, thanks.
2)shortestpath seems to make things go worst... e.g. MATCH path =
shortestPath((S)-[:CONNECTED*1..2]->(E)) increase my execution..
3)yes, CONNECTED
APOC: awesome, but wich algo can I use in order to increase performance? I
have only the starting node and
Thank you so much Craig.. if you can express about that topic some more it
would be great..
SPATIAL: well that is an idea that I was evaluating.. first of all: if I
reduce the number of nodes still the number of relations and the paths to
calculate won't change will this be enought in order to
Thank you so much Michael,
About point
1) yes that will improve the exution time,thanks
2) well... I noticed that it will increase the execution time.. if I write
MATCH path = shortestPath((S)-[:CONNECTED*1..2]->(E)) I saw time increase,
Am I doing a mistake?
3)yeah, my relation's type is CONNE
Regarding Neo4j Spatial, I'm curious if that was used to import the OSM
data in the first place? If so, the graph model you get is not ideal for
routing, or in fact any algorithm that searches for least cost paths, which
yours does. This is because the graph is the full OSM graph with all
intermedi
Hi,
1. you should use a label + index or constraint to find your starting node
2. I'd change it to use shortest path perhaps, at least rewrite it a bit
3. do you have only one relationship-type ?
// lookup via label + osm_id in index/constraint
MATCH (S:Waypoint) WHERE S.osm_id="1683208894"
MATC
Hi everyone,
I'm new in Neo4j world, I'm trying to elaborate isochrones in very large DB
created from osm datas and loaded into Neo4j.
Isochrones should be intended as: "All nodes reachable from a starting node
within a certain time", in my db the nodes are for example the crossroads
of a city a
