public static interface GraphTraversal.Admin<S,E> extends Traversal.Admin<S,E>, GraphTraversal<S,E>
|Modifier and Type||Method and Description|
Cloning is used to duplicate the traversal typically in OLAP environments.
Iterate all the
addStart, addStarts, addStep, applyStrategies, equals, getBytecode, getEndStep, getGraph, getParent, getSideEffects, getStartStep, getSteps, getStrategies, getTraverserGenerator, getTraverserRequirements, isLocked, nextTraverser, removeStep, removeStep, reset, setGraph, setParent, setSideEffects, setStrategies
addE, addE, addV, addV, addV, aggregate, and, as, asAdmin, 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, constant, count, count, cyclicPath, dedup, dedup, drop, 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, inE, inject, inV, is, is, key, label, limit, limit, local, 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, repeat, sack, sack, sample, sample, select, select, select, select, select, 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
close, explain, fill, forEachRemaining, forEachRemaining, next, none, promise, toBulkSet, toList, toSet, toStream, tryNext
default <E2> GraphTraversal.Admin<S,E2> addStep(Step<?,E2> step)
Stepto the end of the traversal. This method should link the step to its next and previous step accordingly.
default GraphTraversal<S,E> iterate()
Traverserinstances 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.
Copyright © 2013–2018 Apache Software Foundation. All rights reserved.