The procedures support the following config parameters:
name | type | default | description |
---|---|---|---|
minLevel |
Long |
-1 |
the minimum number of hops in the traversal. Must be 0 or 1 if specified |
maxLevel |
Long |
-1 |
the maximum number of hops in the traversal |
relationshipFilter |
String |
null |
the relationship types and directions to traverse. See :graph-querying/expand-subgraph.adoc#expand-subgraph-relationship-filters. |
labelFilter |
String |
null |
the node labels to traverse. See :graph-querying/expand-subgraph.adoc#expand-subgraph-label-filters. |
beginSequenceAtStart |
Boolean |
true |
starts matching sequences of node labels and/or relationship types (defined in |
bfs |
Boolean |
true |
use Breadth First Search when traversing. Uses Depth First Search if set to |
filterStartNode |
Boolean |
false |
whether the |
limit |
Long |
-1 |
limit the number of paths returned. When using |
endNodes |
List<Node> |
null |
only these nodes can end returned paths, and expansion will continue past these nodes, if possible. |
terminatorNodes |
List<Node> |
null |
Only these nodes can end returned paths, and expansion won’t continue past these nodes. |
whitelistNodes |
List<Node> |
null |
Only these nodes are allowed in the expansion (though endNodes and terminatorNodes will also be allowed, if present). |
blacklistNodes |
List<Node> |
null |
None of the paths returned will include these nodes. |
It also has the following fixed parameter:
name | type | default | description |
---|---|---|---|
uniqueness |
String |
NODE_GLOBAL |
the strategy to use when expanding relationships in a traversal.
|
Was this page helpful?