Uses of Interface
org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.GraphTraversal

Packages that use GraphTraversal

Package	Description
org.apache.tinkerpop.gremlin
org.apache.tinkerpop.gremlin.process.traversal.dsl.graph

Uses of GraphTraversal in org.apache.tinkerpop.gremlin

Methods in org.apache.tinkerpop.gremlin that return GraphTraversal

Modifier and Type	Method and Description
GraphTraversal<Vertex,VertexProperty<Object>>	AbstractGremlinTest.convertToVertexProperty(Graph graph, String vertexName, String vertexPropertyKey)
GraphTraversal<Vertex,Object>	AbstractGremlinTest.convertToVertexPropertyId(Graph g, String vertexName, String vertexPropertyKey)
GraphTraversal<Vertex,Object>	AbstractGremlinTest.convertToVertexPropertyId(String vertexName, String vertexPropertyKey)

Uses of GraphTraversal in org.apache.tinkerpop.gremlin.process.traversal.dsl.graph

Subinterfaces of GraphTraversal in org.apache.tinkerpop.gremlin.process.traversal.dsl.graph

Modifier and Type	Interface and Description
static interface	GraphTraversal.Admin<S,E>

Classes in org.apache.tinkerpop.gremlin.process.traversal.dsl.graph that implement GraphTraversal

Modifier and Type	Class and Description
class	DefaultGraphTraversal<S,E>
class	EmptyGraphTraversal<S,E>

Methods in org.apache.tinkerpop.gremlin.process.traversal.dsl.graph that return GraphTraversal

Modifier and Type	Method and Description
static <A> GraphTraversal<A,A>	__.__(A... starts)
default GraphTraversal<S,Edge>	GraphTraversal.addE(Direction direction, String firstVertexKeyOrEdgeLabel, String edgeLabelOrSecondVertexKey, Object... propertyKeyValues)
static <A> GraphTraversal<A,Edge>	__.addE(Direction direction, String firstVertexKeyOrEdgeLabel, String edgeLabelOrSecondVertexKey, Object... propertyKeyValues)
default GraphTraversal<S,Edge>	GraphTraversal.addInE(String firstVertexKeyOrEdgeLabel, String edgeLabelOrSecondVertexKey, Object... propertyKeyValues)
static <A> GraphTraversal<A,Edge>	__.addInE(String firstVertexKeyOrEdgeLabel, String edgeLabelOrSecondVertexKey, Object... propertyKeyValues)
default GraphTraversal<S,Edge>	GraphTraversal.addOutE(String firstVertexKeyOrEdgeLabel, String edgeLabelOrSecondVertexKey, Object... propertyKeyValues)
static <A> GraphTraversal<A,Edge>	__.addOutE(String firstVertexKeyOrEdgeLabel, String edgeLabelOrSecondVertexKey, Object... propertyKeyValues)
GraphTraversal<Vertex,Vertex>	GraphTraversalSource.addV(Object... keyValues)
GraphTraversal<Vertex,Vertex>	GraphTraversalSource.GraphTraversalSourceStub.addV(Object... keyValues)
default GraphTraversal<S,Vertex>	GraphTraversal.addV(Object... keyValues)
static <A> GraphTraversal<A,Vertex>	__.addV(Object... propertyKeyValues)
default GraphTraversal<S,E>	GraphTraversal.aggregate(String sideEffectKey)
static <A> GraphTraversal<A,A>	__.aggregate(String sideEffectKey)
default GraphTraversal<S,E>	GraphTraversal.and(Traversal<?,?>... andTraversals)
static <A> GraphTraversal<A,A>	__.and(Traversal<?,?>... andTraversals)
default GraphTraversal<S,E>	GraphTraversal.as(String stepLabel, String... stepLabels)
static <A> GraphTraversal<A,A>	__.as(String label, String... labels)
default GraphTraversal<S,E>	GraphTraversal.barrier()
static <A> GraphTraversal<A,A>	__.barrier()
default GraphTraversal<S,E>	GraphTraversal.barrier(int maxBarrierSize)
static <A> GraphTraversal<A,A>	__.barrier(int maxBarrierSize)
default GraphTraversal<S,Vertex>	GraphTraversal.both(String... edgeLabels) Map the Vertex to its adjacent vertices given the edge labels.
static <A> GraphTraversal<A,Vertex>	__.both(String... edgeLabels)
default GraphTraversal<S,Edge>	GraphTraversal.bothE(String... edgeLabels) Map the Vertex to its incident edges given the edge labels.
static <A> GraphTraversal<A,Edge>	__.bothE(String... edgeLabels)
default GraphTraversal<S,Vertex>	GraphTraversal.bothV() Map the Edge to its incident vertices.
static <A> GraphTraversal<A,Vertex>	__.bothV()
static <A,M,B> GraphTraversal<A,B>	__.branch(Function<Traverser<A>,M> function)
default <M,E2> GraphTraversal<S,E2>	GraphTraversal.branch(Function<Traverser<E>,M> function)
static <A,M,B> GraphTraversal<A,B>	__.branch(Traversal<?,M> traversalFunction)
default <M,E2> GraphTraversal<S,E2>	GraphTraversal.branch(Traversal<?,M> branchTraversal)
default GraphTraversal<S,E>	GraphTraversal.by()
default GraphTraversal<S,E>	GraphTraversal.by(Comparator<E> comparator)
default <V> GraphTraversal<S,E>	GraphTraversal.by(Function<Element,V> elementFunctionProjection, Comparator<V> elementFunctionValueComparator)
default <V> GraphTraversal<S,E>	GraphTraversal.by(Function<V,Object> functionProjection)
default GraphTraversal<S,E>	GraphTraversal.by(Order order)
default GraphTraversal<S,E>	GraphTraversal.by(String elementPropertyKey)
default <V> GraphTraversal<S,E>	GraphTraversal.by(String elementPropertyProjection, Comparator<V> propertyValueComparator)
default GraphTraversal<S,E>	GraphTraversal.by(T tokenProjection)
default GraphTraversal<S,E>	GraphTraversal.by(Traversal<?,?> byTraversal)
default <V> GraphTraversal<S,E>	GraphTraversal.by(Traversal<?,?> traversal, Comparator<V> endComparator)
static <A,B> GraphTraversal<A,B>	__.cap(String sideEffectKey, String... sideEffectKeys)
default <E2> GraphTraversal<S,E2>	GraphTraversal.cap(String sideEffectKey, String... sideEffectKeys)
static <A,M,B> GraphTraversal<A,B>	__.choose(Function<A,M> choiceFunction)
default <M,E2> GraphTraversal<S,E2>	GraphTraversal.choose(Function<E,M> choiceFunction)
static <A,B> GraphTraversal<A,B>	__.choose(Predicate<A> choosePredicate, Traversal<?,B> trueChoice, Traversal<?,B> falseChoice)
default <E2> GraphTraversal<S,E2>	GraphTraversal.choose(Predicate<E> choosePredicate, Traversal<?,E2> trueChoice, Traversal<?,E2> falseChoice)
default <E2> GraphTraversal<S,E2>	GraphTraversal.choose(Traversal<?,?> traversalPredicate, Traversal<?,E2> trueChoice, Traversal<?,E2> falseChoice)
static <A,M,B> GraphTraversal<A,B>	__.choose(Traversal<?,M> traversalFunction)
default <M,E2> GraphTraversal<S,E2>	GraphTraversal.choose(Traversal<?,M> choiceTraversal)
static <A,M,B> GraphTraversal<A,B>	__.choose(Traversal<?,M> traversalPredicate, Traversal<?,B> trueChoice, Traversal<?,B> falseChoice)
static <A,B> GraphTraversal<A,B>	__.coalesce(Traversal<?,B>... traversals)
default <E2> GraphTraversal<S,E2>	GraphTraversal.coalesce(Traversal<?,E2>... coalesceTraversals)
default GraphTraversal<S,E>	GraphTraversal.coin(double probability) Filter the E object given a biased coin toss.
static <A> GraphTraversal<A,A>	__.coin(double probability)
static <A> GraphTraversal<A,A>	__.constant(A a)
default <E2> GraphTraversal<S,E2>	GraphTraversal.constant(E2 e) Map any object to a fixed E value.
default GraphTraversal<S,Long>	GraphTraversal.count() Map the traversal stream to its reduction as a sum of the Traverser.bulk() values (i.e.
static <A> GraphTraversal<A,Long>	__.count()
default GraphTraversal<S,Long>	GraphTraversal.count(Scope scope)
static <A> GraphTraversal<A,Long>	__.count(Scope scope)
default GraphTraversal<S,E>	GraphTraversal.cyclicPath() Filter the E object if its Traverser.path() is Path.isSimple().
static <A> GraphTraversal<A,A>	__.cyclicPath()
default GraphTraversal<S,E>	GraphTraversal.dedup(Scope scope, String... dedupLabels) Remove all duplicates in the traversal stream up to this point.
static <A> GraphTraversal<A,A>	__.dedup(Scope scope, String... dedupLabels)
default GraphTraversal<S,E>	GraphTraversal.dedup(String... dedupLabels) Remove all duplicates in the traversal stream up to this point.
static <A> GraphTraversal<A,A>	__.dedup(String... dedupLabels)
default GraphTraversal<S,E>	GraphTraversal.drop()
static <A> GraphTraversal<A,A>	__.drop()
GraphTraversal<Edge,Edge>	GraphTraversalSource.E(Object... edgesIds)
GraphTraversal<Edge,Edge>	GraphTraversalSource.GraphTraversalSourceStub.E(Object... edgesIds)
default GraphTraversal<S,E>	GraphTraversal.emit()
static <A> GraphTraversal<A,A>	__.emit()
static <A> GraphTraversal<A,A>	__.emit(Predicate<Traverser<A>> emitPredicate)
default GraphTraversal<S,E>	GraphTraversal.emit(Predicate<Traverser<E>> emitPredicate)
default GraphTraversal<S,E>	GraphTraversal.emit(Traversal<?,?> emitTraversal)
static <A> GraphTraversal<A,A>	__.emit(Traversal<?,?> emitTraversal)
static <A> GraphTraversal<A,A>	__.filter(Predicate<Traverser<A>> predicate)
default GraphTraversal<S,E>	GraphTraversal.filter(Predicate<Traverser<E>> predicate)
default GraphTraversal<S,E>	GraphTraversal.filter(Traversal<?,?> filterTraversal)
static <A> GraphTraversal<A,A>	__.filter(Traversal<?,?> filterTraversal)
static <A,B> GraphTraversal<A,B>	__.flatMap(Function<Traverser<A>,Iterator<B>> function)
default <E2> GraphTraversal<S,E2>	GraphTraversal.flatMap(Function<Traverser<E>,Iterator<E2>> function) Map a Traverser referencing an object of type E to an iterator of objects of type E2.
static <A,B> GraphTraversal<A,B>	__.flatMap(Traversal<?,B> flatMapTraversal)
default <E2> GraphTraversal<S,E2>	GraphTraversal.flatMap(Traversal<?,E2> flatMapTraversal) Map a Traverser referencing an object of type E to an iterator of objects of type E2.
default GraphTraversal<S,List<E>>	GraphTraversal.fold()
static <A> GraphTraversal<A,List<A>>	__.fold()
static <A,B> GraphTraversal<A,B>	__.fold(B seed, BiFunction<B,A,B> foldFunction)
default <E2> GraphTraversal<S,E2>	GraphTraversal.fold(E2 seed, BiFunction<E2,E,E2> foldFunction)
static <A,K,R> GraphTraversal<A,Map<K,R>>	__.group()
default <K,R> GraphTraversal<S,Map<K,R>>	GraphTraversal.group()
default GraphTraversal<S,E>	GraphTraversal.group(String sideEffectKey)
static <A> GraphTraversal<A,A>	__.group(String sideEffectKey)
static <A,B> GraphTraversal<A,Map<B,Long>>	__.groupCount()
default <E2> GraphTraversal<S,Map<E2,Long>>	GraphTraversal.groupCount()
default GraphTraversal<S,E>	GraphTraversal.groupCount(String sideEffectKey)
static <A> GraphTraversal<A,A>	__.groupCount(String sideEffectKey)
default GraphTraversal<S,E>	GraphTraversal.has(String propertyKey)
static <A> GraphTraversal<A,A>	__.has(String propertyKey)
default GraphTraversal<S,E>	GraphTraversal.has(String propertyKey, Object value)
static <A> GraphTraversal<A,A>	__.has(String propertyKey, Object value)
default GraphTraversal<S,E>	GraphTraversal.has(String propertyKey, P<?> predicate)
static <A> GraphTraversal<A,A>	__.has(String propertyKey, P<?> predicate)
default GraphTraversal<S,E>	GraphTraversal.has(String label, String propertyKey, Object value)
static <A> GraphTraversal<A,A>	__.has(String label, String propertyKey, Object value)
default GraphTraversal<S,E>	GraphTraversal.has(String label, String propertyKey, P<?> predicate)
static <A> GraphTraversal<A,A>	__.has(String label, String propertyKey, P<?> predicate)
default GraphTraversal<S,E>	GraphTraversal.has(String propertyKey, Traversal<?,?> propertyTraversal)
static <A> GraphTraversal<A,A>	__.has(String propertyKey, Traversal<?,?> propertyTraversal)
default GraphTraversal<S,E>	GraphTraversal.has(T accessor, Object value)
static <A> GraphTraversal<A,A>	__.has(T accessor, Object value)
default GraphTraversal<S,E>	GraphTraversal.has(T accessor, P<?> predicate)
static <A> GraphTraversal<A,A>	__.has(T accessor, P<?> predicate)
default GraphTraversal<S,E>	GraphTraversal.hasId(Object... ids)
static <A> GraphTraversal<A,A>	__.hasId(Object... ids)
default GraphTraversal<S,E>	GraphTraversal.hasKey(String... keys)
static <A> GraphTraversal<A,A>	__.hasKey(String... keys)
default GraphTraversal<S,E>	GraphTraversal.hasLabel(String... labels)
static <A> GraphTraversal<A,A>	__.hasLabel(String... labels)
default GraphTraversal<S,E>	GraphTraversal.hasNot(String propertyKey)
static <A> GraphTraversal<A,A>	__.hasNot(String propertyKey)
default GraphTraversal<S,E>	GraphTraversal.hasValue(Object... values)
static <A> GraphTraversal<A,A>	__.hasValue(Object... values)
default GraphTraversal<S,Object>	GraphTraversal.id() Map the Element to its Element.id().
static <A> GraphTraversal<A,Object>	__.id()
default GraphTraversal<S,E>	GraphTraversal.identity() Map the E object to itself.
static <A> GraphTraversal<A,A>	__.identity()
default GraphTraversal<S,Vertex>	GraphTraversal.in(String... edgeLabels) Map the Vertex to its incoming adjacent vertices given the edge labels.
static <A> GraphTraversal<A,Vertex>	__.in(String... edgeLabels)
default GraphTraversal<S,Edge>	GraphTraversal.inE(String... edgeLabels) Map the Vertex to its incoming incident edges given the edge labels.
static <A> GraphTraversal<A,Edge>	__.inE(String... edgeLabels)
static <A> GraphTraversal<A,A>	__.inject(A... injections)
default GraphTraversal<S,E>	GraphTraversal.inject(E... injections)
default GraphTraversal<S,Vertex>	GraphTraversal.inV() Map the Edge to its incoming/head incident Vertex.
static <A> GraphTraversal<A,Vertex>	__.inV()
default GraphTraversal<S,E>	GraphTraversal.is(Object value) Filter the E object if it is not P.eq(V) to the provided value.
static <A> GraphTraversal<A,A>	__.is(Object value)
static <A> GraphTraversal<A,A>	__.is(P<A> predicate)
default GraphTraversal<S,E>	GraphTraversal.is(P<E> predicate)
GraphTraversal<S,E>	EmptyGraphTraversal.iterate()
GraphTraversal<S,E>	DefaultGraphTraversal.iterate()
default GraphTraversal<S,E>	GraphTraversal.iterate()
default GraphTraversal<S,E>	GraphTraversal.Admin.iterate()
default GraphTraversal<S,String>	GraphTraversal.key() Map the Property to its Property.key().
static <A> GraphTraversal<A,String>	__.key()
default GraphTraversal<S,String>	GraphTraversal.label() Map the Element to its Element.label().
static <A> GraphTraversal<A,String>	__.label()
default GraphTraversal<S,E>	GraphTraversal.limit(long limit)
static <A> GraphTraversal<A,A>	__.limit(long limit)
static <A> GraphTraversal<A,A>	__.limit(Scope scope, long limit)
default <E2> GraphTraversal<S,E2>	GraphTraversal.limit(Scope scope, long limit)
static <A,B> GraphTraversal<A,B>	__.local(Traversal<?,B> localTraversal)
default <E2> GraphTraversal<S,E2>	GraphTraversal.local(Traversal<?,E2> localTraversal)
static <A,B> GraphTraversal<A,B>	__.map(Function<Traverser<A>,B> function)
default <E2> GraphTraversal<S,E2>	GraphTraversal.map(Function<Traverser<E>,E2> function) Map a traverser referencing an object of type E to an object of type E2.
static <A,B> GraphTraversal<A,B>	__.map(Traversal<?,B> mapTraversal)
default <E2> GraphTraversal<S,E2>	GraphTraversal.map(Traversal<?,E2> mapTraversal)
static <A,B> GraphTraversal<A,B>	__.mapKeys()
default <E2> GraphTraversal<S,E2>	GraphTraversal.mapKeys()
static <A,B> GraphTraversal<A,B>	__.mapValues()
default <E2> GraphTraversal<S,E2>	GraphTraversal.mapValues()
static <A,B> GraphTraversal<A,Map<String,B>>	__.match(Traversal<?,?>... matchTraversals)
default <E2> GraphTraversal<S,Map<String,E2>>	GraphTraversal.match(Traversal<?,?>... matchTraversals) Map the Traverser to a Map of bindings as specified by the provided match traversals.
static <A,B extends Number> GraphTraversal<A,B>	__.max()
default <E2 extends Number> GraphTraversal<S,E2>	GraphTraversal.max()
static <A,B extends Number> GraphTraversal<A,B>	__.max(Scope scope)
default <E2 extends Number> GraphTraversal<S,E2>	GraphTraversal.max(Scope scope)
default GraphTraversal<S,Double>	GraphTraversal.mean()
static <A> GraphTraversal<A,Double>	__.mean()
default GraphTraversal<S,Double>	GraphTraversal.mean(Scope scope)
static <A> GraphTraversal<A,Double>	__.mean(Scope scope)
static <A,B extends Number> GraphTraversal<A,B>	__.min()
default <E2 extends Number> GraphTraversal<S,E2>	GraphTraversal.min()
static <A,B extends Number> GraphTraversal<A,B>	__.min(Scope scope)
default <E2 extends Number> GraphTraversal<S,E2>	GraphTraversal.min(Scope scope)
default GraphTraversal<S,E>	GraphTraversal.not(Traversal<?,?> notTraversal)
static <A> GraphTraversal<A,A>	__.not(Traversal<?,?> notTraversal)
default <M,E2> GraphTraversal<S,E>	GraphTraversal.option(M pickToken, Traversal<E,E2> traversalOption)
default <E2> GraphTraversal<S,E>	GraphTraversal.option(Traversal<E,E2> traversalOption)
default GraphTraversal<S,E>	GraphTraversal.or(Traversal<?,?>... orTraversals)
static <A> GraphTraversal<A,A>	__.or(Traversal<?,?>... orTraversals)
default GraphTraversal<S,E>	GraphTraversal.order() Order all the objects in the traversal up to this point and then emit them one-by-one in their ordered sequence.
static <A> GraphTraversal<A,A>	__.order()
default GraphTraversal<S,E>	GraphTraversal.order(Scope scope) Order either the Scope.local object (e.g.
static <A> GraphTraversal<A,A>	__.order(Scope scope)
default GraphTraversal<S,Vertex>	GraphTraversal.otherV() Map the Edge to the incident vertex that was not just traversed from in the path history.
static <A> GraphTraversal<A,Vertex>	__.otherV()
default GraphTraversal<S,Vertex>	GraphTraversal.out(String... edgeLabels) Map the Vertex to its outgoing adjacent vertices given the edge labels.
static <A> GraphTraversal<A,Vertex>	__.out(String... edgeLabels)
default GraphTraversal<S,Edge>	GraphTraversal.outE(String... edgeLabels) Map the Vertex to its outgoing incident edges given the edge labels.
static <A> GraphTraversal<A,Edge>	__.outE(String... edgeLabels)
default GraphTraversal<S,Vertex>	GraphTraversal.outV() Map the Edge to its outgoing/tail incident Vertex.
static <A> GraphTraversal<A,Vertex>	__.outV()
default GraphTraversal<S,Path>	GraphTraversal.path() Map the Traverser to its Path history via Traverser.path().
static <A> GraphTraversal<A,Path>	__.path()
default GraphTraversal<S,E>	GraphTraversal.profile()
static <A> GraphTraversal<A,A>	__.profile()
static <A,B> GraphTraversal<A,? extends Property<B>>	__.properties(String... propertyKeys)
default <E2> GraphTraversal<S,? extends Property<E2>>	GraphTraversal.properties(String... propertyKeys) Map the Element to its associated properties given the provide property keys.
default GraphTraversal<S,E>	GraphTraversal.property(String key, Object value, Object... keyValues)
static <A> GraphTraversal<A,A>	__.property(String key, Object value, Object... keyValues)
default GraphTraversal<S,E>	GraphTraversal.property(VertexProperty.Cardinality cardinality, String key, Object value, Object... keyValues)
static <A> GraphTraversal<A,A>	__.property(VertexProperty.Cardinality cardinality, String key, Object value, Object... keyValues)
static <A,B> GraphTraversal<A,Map<String,B>>	__.propertyMap(String... propertyKeys)
default <E2> GraphTraversal<S,Map<String,E2>>	GraphTraversal.propertyMap(String... propertyKeys) Map the Element to a Map of the properties key'd according to their Property.key().
default GraphTraversal<S,E>	GraphTraversal.range(long low, long high)
static <A> GraphTraversal<A,A>	__.range(long low, long high)
static <A> GraphTraversal<A,A>	__.range(Scope scope, long low, long high)
default <E2> GraphTraversal<S,E2>	GraphTraversal.range(Scope scope, long low, long high)
static <A> GraphTraversal<A,A>	__.repeat(Traversal<?,A> traversal)
default GraphTraversal<S,E>	GraphTraversal.repeat(Traversal<?,E> repeatTraversal)
static <A,B> GraphTraversal<A,B>	__.sack()
default <E2> GraphTraversal<S,E2>	GraphTraversal.sack() Map the Traverser to its Traverser.sack() value.
static <A,V> GraphTraversal<A,A>	__.sack(BiFunction<V,A,V> sackFunction)
default <V> GraphTraversal<S,E>	GraphTraversal.sack(BiFunction<V,E,V> sackFunction)
static <A,V> GraphTraversal<A,A>	__.sack(BinaryOperator<V> sackOperator, String elementPropertyKey)
default <V> GraphTraversal<S,E>	GraphTraversal.sack(BinaryOperator<V> sackOperator, String elementPropertyKey)
default GraphTraversal<S,E>	GraphTraversal.sample(int amountToSample)
static <A> GraphTraversal<A,A>	__.sample(int amountToSample)
default GraphTraversal<S,E>	GraphTraversal.sample(Scope scope, int amountToSample)
static <A> GraphTraversal<A,A>	__.sample(Scope scope, int amountToSample)
static <A,B> GraphTraversal<A,B>	__.select(Pop pop, String selectKey)
default <E2> GraphTraversal<S,E2>	GraphTraversal.select(Pop pop, String selectKey)
static <A,B> GraphTraversal<A,Map<String,B>>	__.select(Pop pop, String selectKey1, String selectKey2, String... otherSelectKeys)
default <E2> GraphTraversal<S,Map<String,E2>>	GraphTraversal.select(Pop pop, String selectKey1, String selectKey2, String... otherSelectKeys) Map the Traverser to a Map projection of sideEffect values, map values, and/or path values.
static <A,B> GraphTraversal<A,B>	__.select(String selectKey)
default <E2> GraphTraversal<S,E2>	GraphTraversal.select(String selectKey)
static <A,B> GraphTraversal<A,Map<String,B>>	__.select(String selectKey1, String selectKey2, String... otherSelectKeys)
default <E2> GraphTraversal<S,Map<String,E2>>	GraphTraversal.select(String selectKey1, String selectKey2, String... otherSelectKeys) Map the Traverser to a Map projection of sideEffect values, map values, and/or path values.
static <A> GraphTraversal<A,A>	__.sideEffect(Consumer<Traverser<A>> consumer)
default GraphTraversal<S,E>	GraphTraversal.sideEffect(Consumer<Traverser<E>> consumer)
default GraphTraversal<S,E>	GraphTraversal.sideEffect(Traversal<?,?> sideEffectTraversal)
static <A> GraphTraversal<A,A>	__.sideEffect(Traversal<?,?> sideEffectTraversal)
default GraphTraversal<S,E>	GraphTraversal.simplePath() Filter the E object if its Traverser.path() is not Path.isSimple().
static <A> GraphTraversal<A,A>	__.simplePath()
static <A> GraphTraversal<A,A>	__.start()
default GraphTraversal<S,E>	GraphTraversal.store(String sideEffectKey)
static <A> GraphTraversal<A,A>	__.store(String sideEffectKey)
default GraphTraversal<S,Edge>	GraphTraversal.subgraph(String sideEffectKey)
static <A> GraphTraversal<A,Edge>	__.subgraph(String sideEffectKey)
default GraphTraversal<S,Double>	GraphTraversal.sum() Map the traversal stream to its reduction as a sum of the Traverser.get() values multiplied by their Traverser.bulk() (i.e.
static <A> GraphTraversal<A,Double>	__.sum()
default GraphTraversal<S,Double>	GraphTraversal.sum(Scope scope)
static <A> GraphTraversal<A,Double>	__.sum(Scope scope)
default GraphTraversal<S,E>	GraphTraversal.tail()
static <A> GraphTraversal<A,A>	__.tail()
default GraphTraversal<S,E>	GraphTraversal.tail(long limit)
static <A> GraphTraversal<A,A>	__.tail(long limit)
static <A> GraphTraversal<A,A>	__.tail(Scope scope)
default <E2> GraphTraversal<S,E2>	GraphTraversal.tail(Scope scope)
static <A> GraphTraversal<A,A>	__.tail(Scope scope, long limit)
default <E2> GraphTraversal<S,E2>	GraphTraversal.tail(Scope scope, long limit)
default GraphTraversal<S,E>	GraphTraversal.timeLimit(long timeLimit) Once the first Traverser hits this step, a count down is started.
static <A> GraphTraversal<A,A>	__.timeLimit(long timeLimit)
default GraphTraversal<S,E>	GraphTraversal.times(int maxLoops)
static <A> GraphTraversal<A,A>	__.times(int maxLoops)
default GraphTraversal<S,Vertex>	GraphTraversal.to(Direction direction, String... edgeLabels) Map the Vertex to its adjacent vertices given a direction and edge labels.
static <A> GraphTraversal<A,Vertex>	__.to(Direction direction, String... edgeLabels)
default GraphTraversal<S,Edge>	GraphTraversal.toE(Direction direction, String... edgeLabels) Map the Vertex to its incident edges given the direction and edge labels.
static <A> GraphTraversal<A,Edge>	__.toE(Direction direction, String... edgeLabels)
default GraphTraversal<S,Vertex>	GraphTraversal.toV(Direction direction) Map the Edge to its incident vertices given the direction.
static <A> GraphTraversal<A,Vertex>	__.toV(Direction direction)
default GraphTraversal<S,Tree>	GraphTraversal.tree()
static <A> GraphTraversal<A,Tree>	__.tree()
default GraphTraversal<S,E>	GraphTraversal.tree(String sideEffectKey)
static <A> GraphTraversal<A,A>	__.tree(String sideEffectKey)
static <A> GraphTraversal<A,A>	__.unfold()
default <E2> GraphTraversal<S,E2>	GraphTraversal.unfold()
static <A,B> GraphTraversal<A,B>	__.union(Traversal<?,B>... traversals)
default <E2> GraphTraversal<S,E2>	GraphTraversal.union(Traversal<?,E2>... unionTraversals)
static <A> GraphTraversal<A,A>	__.until(Predicate<Traverser<A>> untilPredicate)
default GraphTraversal<S,E>	GraphTraversal.until(Predicate<Traverser<E>> untilPredicate)
default GraphTraversal<S,E>	GraphTraversal.until(Traversal<?,?> untilTraversal)
static <A> GraphTraversal<A,A>	__.until(Traversal<?,?> untilTraversal)
GraphTraversal<Vertex,Vertex>	GraphTraversalSource.V(Object... vertexIds)
GraphTraversal<Vertex,Vertex>	GraphTraversalSource.GraphTraversalSourceStub.V(Object... vertexIds)
static <A,B> GraphTraversal<A,B>	__.value()
default <E2> GraphTraversal<S,E2>	GraphTraversal.value() Map the Property to its Property.value().
static <A,B> GraphTraversal<A,Map<String,B>>	__.valueMap(boolean includeTokens, String... propertyKeys)
default <E2> GraphTraversal<S,Map<String,E2>>	GraphTraversal.valueMap(boolean includeTokens, String... propertyKeys) Map the Element to a Map of the property values key'd according to their Property.key().
static <A,B> GraphTraversal<A,Map<String,B>>	__.valueMap(String... propertyKeys)
default <E2> GraphTraversal<S,Map<String,E2>>	GraphTraversal.valueMap(String... propertyKeys) Map the Element to a Map of the property values key'd according to their Property.key().
static <A,B> GraphTraversal<A,B>	__.values(String... propertyKeys)
default <E2> GraphTraversal<S,E2>	GraphTraversal.values(String... propertyKeys) Map the Element to the values of the associated properties given the provide property keys.
default GraphTraversal<S,E>	GraphTraversal.where(P<String> predicate)
static <A> GraphTraversal<A,A>	__.where(P<String> predicate)
default GraphTraversal<S,E>	GraphTraversal.where(String startKey, P<String> predicate)
static <A> GraphTraversal<A,A>	__.where(String startKey, P<String> predicate)
default GraphTraversal<S,E>	GraphTraversal.where(Traversal<?,?> whereTraversal)
static <A> GraphTraversal<A,A>	__.where(Traversal<?,?> whereTraversal)