create complex gremlin-java query
问题 I have model implemented in titan graph database with relations presented below: [A] ---(e1)---> [B] <---(e2)--- [C] ---(e3)---> [D] | | | | | | | prop:id | prop:number | | label:e3 | | | prop:id | label:e1 label:e2 prop:number prop:prop1 A and B are "main vertices" (for example users), vertices B and C are "less important vertices" describing some data connected with users. The input for the query algorithm is property id of vertex A . I want to find all such vertices D , that are connected