public class DefaultGraphTraversal<S,E> extends DefaultTraversal<S,E> implements GraphTraversal.Admin<S,E>
GraphTraversal.Admin<S,E>, GraphTraversal.SymbolsTraversal.Exceptionsbytecode, g, generator, graph, locked, parent, requirements, sideEffects, steps, strategies, unmodifiableSteps| Constructor and Description |
|---|
DefaultGraphTraversal() |
DefaultGraphTraversal(Graph graph) |
DefaultGraphTraversal(GraphTraversalSource graphTraversalSource) |
| Modifier and Type | Method and Description |
|---|---|
GraphTraversal.Admin<S,E> |
asAdmin()
Get access to administrative methods of the traversal via its accompanying
Traversal.Admin. |
DefaultGraphTraversal<S,E> |
clone()
Cloning is used to duplicate the traversal typically in OLAP environments.
|
GraphTraversal<S,E> |
iterate()
Iterate all the
Traverser instances in the traversal. |
addStart, addStarts, addStep, applyStrategies, equals, getBytecode, getEndStep, getGraph, getParent, getSideEffects, getStartStep, getSteps, getStrategies, getTraversalSource, getTraverserGenerator, getTraverserRequirements, hashCode, hasNext, isLocked, next, nextTraverser, removeStep, reset, setGraph, setParent, setSideEffects, setStrategies, toStringfinalize, getClass, notify, notifyAll, wait, wait, waitaddStepaddStart, addStarts, addStep, applyStrategies, equals, getBytecode, getEndStep, getGraph, getParent, getSideEffects, getStartStep, getSteps, getStrategies, getTraversalSource, getTraverserGenerator, getTraverserRequirements, getTraverserSetSupplier, isLocked, nextTraverser, removeStep, removeStep, reset, setGraph, setParent, setSideEffects, setStrategiesaddE, addE, addV, addV, addV, aggregate, aggregate, and, as, barrier, barrier, barrier, both, bothE, bothV, branch, branch, by, by, by, by, by, by, by, by, by, by, cap, choose, choose, choose, choose, choose, choose, coalesce, coin, connectedComponent, constant, count, count, cyclicPath, dedup, dedup, drop, elementMap, emit, emit, emit, filter, filter, flatMap, flatMap, fold, fold, from, from, from, group, group, groupCount, groupCount, has, has, has, has, has, has, has, has, has, hasId, hasId, hasKey, hasKey, hasLabel, hasLabel, hasNot, hasValue, hasValue, id, identity, in, index, inE, inject, inV, is, is, key, label, limit, limit, local, loops, loops, map, map, match, math, max, max, mean, mean, min, min, not, option, option, optional, or, order, order, otherV, out, outE, outV, pageRank, pageRank, path, peerPressure, profile, profile, program, project, properties, property, property, propertyMap, range, range, read, repeat, repeat, sack, sack, sample, sample, select, select, select, select, select, select, select, shortestPath, sideEffect, sideEffect, simplePath, skip, skip, store, subgraph, sum, sum, tail, tail, tail, tail, timeLimit, times, to, to, to, to, toE, toV, tree, tree, unfold, union, until, until, V, value, valueMap, valueMap, values, where, where, where, with, with, writepublic DefaultGraphTraversal()
public DefaultGraphTraversal(GraphTraversalSource graphTraversalSource)
public DefaultGraphTraversal(Graph graph)
public GraphTraversal.Admin<S,E> asAdmin()
TraversalTraversal.Admin.public GraphTraversal<S,E> iterate()
TraversalTraverser instances in the traversal.
What is returned is the empty traversal.
It is assumed that what is desired from the computation is are the sideEffects yielded by the traversal.public DefaultGraphTraversal<S,E> clone()
Traversal.Adminclone in interface GraphTraversal.Admin<S,E>clone in interface Traversal.Admin<S,E>clone in class DefaultTraversal<S,E>Copyright © 2013–2020 Apache Software Foundation. All rights reserved.