July 13, 2018

The sack traversal in Gremlin is kind of like giving an empty bag (or sack) to every gremlin traverser in your graph. The gremlins carry their bag as they walk around the graph, and they collect properties about the graph to store in the bag. In...

July 13, 2018

It is a really good idea to customize the language you use to talk about graph traversals to the specific domain. In this unit, you will learn about domain-specific traversals.

July 13, 2018

 The mutating traversal adds or removes vertices, edges, or properties to the graph. In this unit, you will learn about mutating traversals.

July 13, 2018

Ordering traversals are very simple. They arranges objects in a traversal stream into an ordered sequence. They will take objects in, apply some known criteria we give it, and emit the objects one by one in their new order. In this unit, you will...

July 13, 2018

WIth a statistical traversal, we move around the graph and collect statistics about the structure or properties in some way. We are computing aggregates or some kind of analysis that will summarize what is in the graph. In this unit, you will...

July 13, 2018

The subgraph traversal extracts a full subset of the larger graph for analysis, visualization, or some other similar purpose. In this unit, you will learn about subgraph traversals.

July 13, 2018

Gremlin declarative traversals are graph pattern matching traversals. They specify a graph pattern that should be matched against a graph. In this unit, you will learn about declarative traversals.

July 13, 2018

In this unit, you will learn about projecting traversals. A projecting traversal are those steps which use previously labeled traversers in your query and bring them forward to be used again. Projecting traversals generate new traversers that...

July 13, 2018

A path traversal is any Gremlin traversal where we explicitly access a traverser's past history. In this unit, you will learn about path traversals.

July 13, 2018

A recursive traversal is a traversal that contains one or more internal, nested traversals that can be repeatedly evaluated again and again until a certain stopping criterion is met. In this unit, you will learn about recursive traversals.