public static interface GraphTraversal.Admin<S,E> extends Traversal.Admin<S,E>, GraphTraversal<S,E>
GraphTraversal.Admin<S,E>, GraphTraversal.SymbolsTraversal.Exceptions| Modifier and Type | Method and Description |
|---|---|
default <E2> GraphTraversal.Admin<S,E2> |
addStep(Step<?,E2> step)
Add a
Step to the end of the traversal. |
GraphTraversal.Admin<S,E> |
clone()
Cloning is used to duplicate the traversal typically in OLAP environments.
|
default 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, getTraverserSetSupplier, isLocked, isRoot, nextTraverser, removeStep, removeStep, reset, setGraph, setParent, setSideEffects, setStrategiesaddE, addE, addV, addV, addV, aggregate, aggregate, and, as, asAdmin, barrier, barrier, barrier, both, bothE, bothV, branch, branch, by, by, by, by, by, by, by, by, by, by, call, call, call, call, cap, choose, choose, choose, choose, choose, choose, coalesce, coin, connectedComponent, constant, count, count, cyclicPath, dedup, dedup, drop, element, elementMap, emit, emit, emit, fail, fail, 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, mergeE, mergeE, mergeE, mergeV, mergeV, mergeV, min, min, none, not, option, option, option, optional, or, order, order, otherV, out, outE, outV, pageRank, pageRank, path, peerPressure, profile, profile, program, project, properties, property, 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, writeclose, explain, fill, forEachRemaining, forEachRemaining, next, notifyClose, promise, toBulkSet, toList, toSet, toStream, tryNextdefault <E2> GraphTraversal.Admin<S,E2> addStep(Step<?,E2> step)
Traversal.AdminStep to the end of the traversal. This method should link the step to its next and previous step accordingly.addStep in interface Traversal.Admin<S,E>E2 - the output of the stepstep - the step to adddefault 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.GraphTraversal.Admin<S,E> clone()
Traversal.Adminclone in interface Traversal.Admin<S,E>Copyright © 2013–2022 Apache Software Foundation. All rights reserved.