Traversal Steps
Traversals from Nodes
Once you’ve selected your starting points, these operations allow you to navigate through the graph.
The Idea
HelixQL is strongly typed. That means it stops you traversing edges or accessing properties that don’t exist.
Out
Get the nodes connected by outgoing edges of specific type.
Example:
In
Get the nodes connected by incoming edges of specific type.
Example:
OutE
Get the edges connected by outgoing edges of specific type.
Example:
InE
Get the edges connected by incoming edges of specific type.
Example: