Dynamically calculated values from last vertex to select outgoing edges for further traversal
Hi - I asked the question on SO (https://stackoverflow.com/questions/78611365/neptune-graph-traversal-that-uses-dynamically-calculated-values-from-last-vertex) but there is no answer. I am really interested if this is a scenario gremlin can handle. I am not very well versed with Tinkerpop so I am not sure whether I am just trying to build a query that is complex, or asking for a case that is just not supported in tinkerpop. I work for a company that is seriously considering onboarding onto gremlin supported database but we are not sure whether it will really support all our data access patterns. Any help with that SO question would be be greatly appreciated.
Stack Overflow
Here is my graph:
Here is graph building code:
g.addV("Person").property(T.id, "A").as("a")
.addV("Person").property(T.id, "B").as("b...
Here is graph building code:
g.addV("Person").property(T.id, "A").as("a")
.addV("Person").property(T.id, "B").as("b...
