Namespace Gremlin.Net.Process.Traversal
Classes
__
An anonymous GraphTraversal<TStart, TEnd>.
AnonymousTraversalSource
Provides a method for creating a GraphTraversalSource that does not spawn from a
Barrier
Binding
Associates a variable with a value.
Bindings
Bindings are used to associate a variable with a value.
Bytecode
A language agnostic representation of ITraversal mutations.
Cardinality
CardinalityValue
Holds a property value with the associated Cardinality.
Column
ConnectedComponent
DefaultTraversal<TStart, TEnd>
A traversal represents a directed walk over a graph.
Direction
DT
EnumWrapper
Represents an enum.
GraphOp
A graph operation is a static Bytecode form that does not translate to a traversal but instead refers to a specific function to perform on a graph instance.
GraphSONVersion
GraphTraversal<TStart, TEnd>
Graph traversals are the primary way in which graphs are processed.
GraphTraversalSource
A GraphTraversalSource is the primary DSL of the Gremlin traversal machine. It provides access to all the configurations and steps for Turing complete graph computing.
GryoVersion
Instruction
Represents a Bytecode instruction by an operator name and its arguments.
IO
Lambda
Provides methods to create lambdas.
Merge
Operator
Order
P
A P is a predicate of the form Func<object, bool>. That is, given some object, return true or false.
PageRank
PeerPressure
Pick
Pop
Scope
ShortestPath
T
TextP
A TextP is a predicate of the form Func<string, bool>. That is, given some string, return true or false.
Traverser
A traverser represents the current state of an object flowing through a ITraversal.
Interfaces
IBiFunction
Represents a function that accepts two arguments and produces a result. This is the two-arity specialization of IFunction.
IBinaryOperator
Represents an operation upon two operands of the same type, producing a result of the same type as the operands. This is a specialization of IBiFunction for the case where the operands and the result are all of the same type.
IComparator
A comparison function, which imposes a total ordering on some collection of objects.
IConsumer
Represents an operation that accepts a single input argument and returns no result. Unlike most other functional interfaces, Consumer is expected to operate via side-effects.
IFunction
Represents a function that accepts one argument and produces a result.
ILambda
Represents a lambda.
IPredicate
Represents a predicate (boolean-valued function) of one argument.
ISupplier
Represents a supplier of results
ITraversal
Represents the basic information for a walk over a graph.
ITraversal<TStart, TEnd>
A traversal represents a directed walk over a graph.
ITraversalStrategy
A ITraversalStrategy defines a particular atomic operation for mutating a ITraversal prior to its evaluation.
IUnaryOperator
Represents an operation on a single operand that produces a result of the same type as its operand. This is a specialization of Function for the case where the operand and result are of the same type.