Database Reference
In-Depth Information
Pattern for paths
A series of connected nodes is known as a path . All the following examples define the path
in a particular pattern:
(n)-[:REL_TYPE]->(n1)
(n)-->()<--(n1)
(n)-->(x)<--(n1)
We can also assign a path identifier and store the pattern in a variable as follows:
Var = (n)-[:REL_TYPE]->(n1)
Search WWH ::




Custom Search