Represents a sequence of alternating nodes and relationships
corresponding to a walk in a labeled property graph.
A path of length L consists of L + 1 nodes indexed from 0 to L, and L
unbound relationships, indexed from 0 to L - 1. Each relationship has a
direction. A relationship is said to be reversed if it was traversed in the
direction opposite of the direction of the underlying relationship in the
data graph.
Represents a sequence of alternating nodes and relationships corresponding to a walk in a labeled property graph.
A path of length L consists of L + 1 nodes indexed from 0 to L, and L unbound relationships, indexed from 0 to L - 1. Each relationship has a direction. A relationship is said to be reversed if it was traversed in the direction opposite of the direction of the underlying relationship in the data graph.