Skip to content
Simplify construction of complex graph traversals by implementing a traversal builder pattern in Java
Java Groovy Shell
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
bin
src/main
.gitignore
CODE_OF_CONDUCT.md
CONTRIBUTING.md
LICENSE.md
README.md
pom.xml

README.md

Implementing Graph Traversal Builder in Java

This project demonstrates how to implement and use a traversal builder that can significantly simplify the construction of complex traversals.

Contributor(s): Daniel Kuppitz

Objectives

  • Demonstrate how to use the builder pattern to simplify the construction of complex Gremlin traversals

Project Layout

How this Works

The graph being used in this project is based on TinkerPop's modern graph. The only difference is an added uses edge between peter and ripple.

The application can run without a connection to a DataStax Enterprise (DSE) cluster (in that case, it will execute all traversals on a TinkerGraph). The application's user interface will show all the available commands that can be used to establish a connection to a DSE cluster and build/execute certain traversals (note, that there's also support for tab completion).

Setup and Running

Prerequisites

  • Java 8
  • DSE Cluster with Graph enabled or TinkerGraph

Running

To start the sample application, which is a simple CLI application, run the following command from the application's root directory:

bin/run.sh

This shell script will start the application, or recompile and start the application if any source file is newer than the current binary file.

You can’t perform that action at this time.