Skip to content


stephen mallette edited this page Feb 2, 2016 · 325 revisions

IMPORTANT – TinkerPop is now a part of the Apache Software Foundation and TinkerPop 3.x is the latest incarnation of The TinkerPop. This project is TinkerPop 2.x and is no longer active.

Gremlin is a graph traversal language. The documentation herein will provide all the information necessary to understand how to use Gremlin for graph query, analysis, and manipulation. Gremlin works over those graph databases/frameworks that implement the Blueprints property graph data model. Gremlin is a style of graph traversal that can be used in various JVM languages. This distribution of Gremlin provides support for Java and Groovy. Except where otherwise stated, the documentation herein is respective of the Groovy implementation (minor syntactic tweaks are required to map the ideas over to other JVM implementations).

Please join the Gremlin users group at for all TinkerPop related discussions. 1

// calculate basic collaborative filtering for vertex 1
m = [:]

// calculate the primary eigenvector (eigenvector centrality) of a graph
m = [:]; c = 0;'x').out.groupCount(m).loop('x'){c++ < 1000}

The Graph Traversal Programming Pattern (Presentation of Basic Graph Traversal Concepts)
On the Nature of Pipes (Understand the Gremlin Engine)
Gremlin Tutorial 1 (Screencast of Gremlin 0.7)
Gremlin Tutorial 2 (Presentation of Gremlin 1.1)

<!-- * can be java, groovy, or test -->

Non-Maven users can get the raw release jars from Apache’s Central Repository. Snapshots can be obtained from Sonatype (see Maven Repositories for more information).

1 Gremlin documentation is up to date with the current Gremlin codebase, not with the latest Gremlin release.

Gremlin JavaDoc:
Gremlin WikiDoc:

Something went wrong with that request. Please try again.