Head's Up! These forums are read-only. All users and content have migrated. Please join us at community.neo4j.com.
12-02-2021 04:45 PM
Please keep the following things in mind:
Hello everybody, I have a such issue:
I need to find such path where I know everything about start but don't know anything about end
BUT i know that it has to be something that apply some conditions. Let's look at this cypher:
match (start:NodeCell)
where id(start)=162
match west=shortestPath((start)-[c:Connected*]->(end:NodeCell))
where all(r in relationships(west) where r.DIRECTION="WEST") and (end.figureId < 0 or end.house<>start.house or not exists((end)-[:Connected{DIRECTION:"WEST"}]->()))
return distinct west;
Solved! Go to Solution.
12-04-2021 07:16 PM
Two suggestions.
MATCH west=shortestPath((start)-[c:Connected*..30]->(end:NodeCell))
12-04-2021 07:16 PM
Two suggestions.
MATCH west=shortestPath((start)-[c:Connected*..30]->(end:NodeCell))
All the sessions of the conference are now available online