Difference between revisions of "Gremlin Basics"

From BITPlan Wiki
Jump to navigation Jump to search
Line 45: Line 45:
 
   key
 
   key
 
   value
 
   value
 +
}
 +
class Step {
 
}
 
}
 
Traversal - "n traversers" Traverser
 
Traversal - "n traversers" Traverser
 +
Traverser - "n steps" Step
 
Graph - "n vertices" Vertex
 
Graph - "n vertices" Vertex
 
Graph - "1 traversal" GraphTraversalSource
 
Graph - "1 traversal" GraphTraversalSource

Revision as of 18:35, 1 November 2018

Gremlin Paper by Marko Rodriguez

load PDF

DSL

Concepts

Three interacting components

  1. a Graph G
  2. a traversal Ψ
  3. and a set of Traversers T