public class GraqlTraversal extends Object
MatchQuery.
Comprised of ordered Fragments which are used to construct a TinkerPop GraphTraversal, which can be
retrieved and executed.| Modifier and Type | Method and Description |
|---|---|
static GraqlTraversal |
create(Set<? extends List<Fragment>> fragments) |
boolean |
equals(Object o) |
double |
getComplexity()
Get the estimated complexity of the traversal.
|
org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.GraphTraversal<org.apache.tinkerpop.gremlin.structure.Vertex,Map<String,org.apache.tinkerpop.gremlin.structure.Vertex>> |
getGraphTraversal(GraknGraph graph)
Get the
GraphTraversal that this GraqlTraversal represents. |
int |
hashCode() |
static GraqlTraversal |
semiOptimal(PatternAdmin pattern)
Create a semi-optimal traversal plan using a greedy approach
|
String |
toString() |
public static GraqlTraversal create(Set<? extends List<Fragment>> fragments)
public static GraqlTraversal semiOptimal(PatternAdmin pattern)
pattern - a pattern to find a query plan forpublic org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.GraphTraversal<org.apache.tinkerpop.gremlin.structure.Vertex,Map<String,org.apache.tinkerpop.gremlin.structure.Vertex>> getGraphTraversal(GraknGraph graph)
GraphTraversal that this GraqlTraversal represents.public double getComplexity()
Copyright © 2017 Grakn Labs Ltd. All rights reserved.