Skip to main content

The Idea

HelixQL is strongly typed, so you can only traverse edges and access properties that exist in your schema. Select starting points with N or E, then apply traversal steps to walk the graph safely.

::Out   Outgoing Nodes

Return the nodes reached via outgoing edges of a given type.

Example 1: Listing who a user follows


::In   Incoming Nodes

Return the nodes that point to the current selection via incoming edges of the given type.

Example 1: Listing who follows a user


::OutE   Outgoing Edges

Return the outgoing edges themselves (including properties and endpoints) for the given edge type.

Example 1: Inspecting follow relationships


::InE   Incoming Edges

Return incoming edges (with properties and endpoints) for the given type.

Example 1: Inspecting who followed a user

Combine traversal steps with property filtering or aggregation for richer results. See the Property Access and Aggregations guides.