Skip to content

Commit

Permalink
Use Go style step syntax
Browse files Browse the repository at this point in the history
Co-authored-by: Cole Greer <112986082+Cole-Greer@users.noreply.github.com>
  • Loading branch information
ryn5 and Cole-Greer authored Oct 16, 2023
1 parent 994b539 commit b7dd08b
Showing 1 changed file with 3 additions and 3 deletions.
6 changes: 3 additions & 3 deletions gremlin-go/example/example.go
Original file line number Diff line number Diff line change
Expand Up @@ -143,15 +143,15 @@ func modernTraversalExample() {

/*
1. There are three edges from the vertex with the identifier of "1".
2. Filter those three edges using the where()-step using the identifier of the vertex returned by otherV() to
2. Filter those three edges using the Where()-step using the identifier of the vertex returned by OtherV() to
ensure it matches on the vertex of concern, which is the one with an identifier of "2".
3. Note that the same traversal will work if there are actual Vertex instances rather than just vertex
identifiers.
4. The vertex with identifier "1" has all outgoing edges, so it would also be acceptable to use the directional
steps of outE() and inV() since the schema allows it.
steps of OutE() and InV() since the schema allows it.
5. There is also no problem with filtering the terminating side of the traversal on multiple vertices, in this
case, vertices with identifiers "2" and "3".
6. There’s no reason why the same pattern of exclusion used for edges with where() can’t work for a vertex
6. There’s no reason why the same pattern of exclusion used for edges with Where() can’t work for a vertex
between two vertices.
*/
}

0 comments on commit b7dd08b

Please sign in to comment.