Traversals from Nodes

Once you’ve selected your starting points, these operations allow you to navigate through the graph.

HelixQL is strongly typed. That means it stops you traversing edges or accessing properties that don’t exist.

Get the nodes connected by outgoing edges of specific type.

::Out<EdgeType>

Example:

QUERY get_user_following(userID: ID) =>
    following <- N<User>(userID)::Out<Follows>
    RETURN following

Get the nodes connected by incoming edges of specific type.

::In<EdgeType>

Example:

QUERY get_user_followers(userID: ID) =>
    followers <- N<User>(userID)::In<Follows>
    RETURN followers

Get the edges connected by outgoing edges of specific type.

::OutE<EdgeType>

Example:

QUERY get_following_details(userID: ID) =>
    following <- N<User>(userID)::OutE<Follows>
    RETURN following

Get the edges connected by incoming edges of specific type.

::InE<EdgeType>

Example:

QUERY get_followers_details(userID: ID) =>
    followers <- N<User>(userID)::InE<Follows>
    RETURN followers