1. Docs
2. Reference
3. REST API Docs
4. Schema
5. GraphTraverseStep

One typed, bounded traversal step. Starting from the previous frontier, follows edges of the given type in the given direction up to the depth bound.

Properties

• edgeTypes array[string] required
  The edge type(s) to follow, as listed in the graph schema. Multiple types may be named together only when they share the same backing store (for example reference and inferred_reference); naming the same type twice, or types that span different backing stores, is rejected with a 400.
• direction enum required
  Direction to walk edges relative to the current frontier.
  Values: in, out, both
• depth GraphDepthRange optional
  Bounded traversal depth. Defaults to exactly one hop (min 1, max 1).
• ↳ min integer required
  Minimum hop count. 0 keeps the source frontier in the result.
• ↳ max integer required
  Maximum hop count. At least 1, and bounded by the engine’s maxDepth limit reported by the graph schema endpoint.
• target GraphTraverseTarget optional
  Terminal predicate over the nodes reached by this step.
• ↳ match GraphNodeMatch optional
  Structured predicate the reached nodes must satisfy. Omit to match every node the step reaches.
• ↳ absent boolean optional
  Pattern negation (anti-join). When true, the step’s result is each source node from which NO path within the depth bound reaches a node matching target.match. Only valid on the final traversal step.
• alias string optional
  Alias for this step’s frontier, referencable from return.select. Defaults to ‘step’ where N is the step’s zero-based index. An alias that collides with ‘anchor’ or with an earlier step is rejected.