I'm trying to get all the unknown vertices that are connected to a known vertex by an edge using C# Datastax CassandraCSharpDriver.Graph code.
This gremlin code correctly returns the list of unknown vertices as well as the target known vertex:
g.V().has("mything","key", "mykey")
.emit()
.repeat(outE("contains").inV()).valueMap(true)
I tried a traversal like this in C# but it doesn't come back, I think the repeat is infinite (or very slow):
g.V()
.Has("mything", "key", "mykey")
.Emit()
.Repeat(g.V()
.Has("mything", "key", "mykey")
.OutE("contains").InV())
I'm trying a traversal like this in C#, but the compiler won't accept '("query")', so I'm not sure how to put the traversal in the Repeat clause:
g.V()
.Has("mything", "key", "mykey")
.As("query").Emit()
.Repeat(("query").OutE("contains").InV())
What's the trick to the Repeat clause? Or is there a better way to get all the unknown vertices connected to a known vertex in C#?