Example Graph
The following examples run against this graph:
path_length()
Returns the number of edges in a path.
| Syntax | path_length(<pathVar>) |
||
| Arguments | Name | Type | Description |
<pathVar> |
PATH |
Path variable reference | |
| Return Type | UINT |
||
MATCH p = ()->{1,3}()
RETURN p, PATH_LENGTH(p) AS length
Result:
| p | length |
|---|---|
| (:Paper {_id: "P1", score: 6, title: "Efficient Graph Search", author: "Alex"})-[:Cites {weight: 2}]->(:Paper {_id: "P2", score: 9, title: "Optimizing Queries", author: "Alex"})-[:Cites {weight: 1]->(:Paper {_id: "P3", score: 7, title: "Path Patterns", author: "Zack"}) | 2 |
| (:Paper {_id: "P1", score: 6, title: "Efficient Graph Search", author: "Alex"})-[:Cites {weight: 2]->(:Paper {_id: "P2", score: 9, title: "Optimizing Queries", author: "Alex"}) | 1 |
| (:Paper {_id: "P2", score: 9, title: "Optimizing Queries", author: "Alex"})-[:Cites {weight: 1]->(:Paper {_id: "P3", score: 7, title: "Path Patterns", author: "Zack"}) | 1 |
pedges()
Collects edges in a path into a list.
| Syntax | pedges(<pathVar>) |
||
| Arguments | Name | Type | Description |
<pathVar> |
PATH |
Path variable reference | |
| Return Type | LIST |
||
MATCH p = ({_id: "P1"})-[]->{1,2}()
RETURN pedges(p)
Result:
| pedges(p) |
|---|
| [{"from":"P1","to":"P2","uuid":"1","from_uuid":"8791028671650463745","to_uuid":"8718971077612535810","schema":"Cites","values":{"weight":2}}] |
| [{"from":"P1","to":"P2","uuid":"1","from_uuid":"8791028671650463745","to_uuid":"8718971077612535810","schema":"Cites","values":{"weight":2}},{"from":"P2","to":"P3","uuid":"2","from_uuid":"8718971077612535810","to_uuid":"12033620403357220867","schema":"Cites","values":{"weight":1}}] |
pnodes()
Collects nodes in a path into a list.
| Syntax | pnodes(<pathVar>) |
||
| Arguments | Name | Type | Description |
<pathVar> |
PATH |
Path variable reference | |
| Return Type | LIST |
||
MATCH p = ({_id: "P1"})-[]->{1,2}()
RETURN pnodes(p)
Result:
| pnodes(p) |
|---|
| [{"id":"P1","uuid":"8791028671650463745","schema":"Paper","values":{"author":"Alex","title":"Efficient Graph Search","score":6}},{"id":"P2","uuid":"8718971077612535810","schema":"Paper","values":{"author":"Alex","title":"Optimizing Queries","score":9}}] |
| [{"id":"P1","uuid":"8791028671650463745","schema":"Paper","values":{"author":"Alex","title":"Efficient Graph Search","score":6}},{"id":"P2","uuid":"8718971077612535810","schema":"Paper","values":{"author":"Alex","title":"Optimizing Queries","score":9}},{"id":"P3","uuid":"12033620403357220867","schema":"Paper","values":{"author":"Zack","title":"Path Patterns","score":7}}] |