Questions tagged [tinkergraph]

TinkerGraph is a lightweight, in-memory graph database that serves as the reference implementation for the property graph model in Apache TinkerPop.

TinkerGraph, of Apache TinkerPop, supports a number of use cases that start with learning about graphs and extend all the way to production. It is most useful for any scenario where the graph data fits in memory. Some examples of this include:

  • Performing analysis on a graph that has static characteristics and does not change.
  • Can be useful in writing unit tests in place of other implementations that require greater resources.
  • Useful for holding and analyzing subgraphs of much larger graph which don't easily fit in memory.

Complete documentation can be found here.

41 questions
0
votes
1 answer

Tinkerpop Select neighbours grouped by the vertex they are neighbour with range step

I want to select all l labelled vertices along with their t labelled vertices grouped by their neighbours. Also I want to apply a limit on the length of the neighbours. For ex for neighbour limit = 2 something like below should be…
0
votes
1 answer

How to reduce a set of vertices until each vertex does not require an another

Suppose I have graph with vertices A, B, C, D, E, F, G, X and they are connected using outgoing edge requires like below A -> X B -> A C -> B D -> C D -> E E -> X F -> G F -> X G -> X Is it possible to reduce a given set of vertices, until each…
John Smith
  • 47
  • 5
0
votes
1 answer

Re-running an existing route in a Tinkerpop Graph

If i have a pre-run route from the shortestPath which is returned as a list of vertex, how can i then re-run that on a graph with the same set of vertices, to return the edges which it has used. i.e. PATH = (V(1), V(2), V(3), V(4), V(5), V(6)), how…
docker dev
  • 91
  • 3
  • 10
0
votes
1 answer

Tinkergraph traversal returning an empty array [] on my graph

I have imported a graph and can confirm that the number of vertex and edges matches the number that should be present. I run the simplepath() compute on the graph and my first question is how to access the path array or map whatever is returned, i…
docker dev
  • 91
  • 3
  • 10
0
votes
1 answer

How can I add a new Vertex only if it is possible to add an Edge too?

I need to add a new Vertex with an Edge. My code is something like: g.V().addV("Vertex").addE("MyEdge").to(V().has("OtherVertex", "name", "test")) If V().has("OtherVertex", "name", "test") return a Vertex, everything works fine. My problem is if…
cmaluenda
  • 2,099
  • 1
  • 14
  • 15
0
votes
1 answer

ScriptEvalutionError : For Input string "" : When supplying a string as ID

I have set up a docker container for tinkerpop/gremlin-server on my dev machine. I have an .NET Core application that uses Gremlin.Net version 3.4.1 I connect to the localhost docker using IGremlinClient and when passing the following query to add…
Liam Hall
  • 147
  • 9
0
votes
1 answer

Tinkerpop3 custom edge id generator

I use TinkerGraph for integration tests (extended unit tests) in Java. In this implementation Edge ids are generated as a sequence of Integers. I want to change that so they are generated as random UUIDs. The reason for this is to get my test setup…
AnnTea
  • 532
  • 7
  • 15
0
votes
2 answers

erlang connecting to tinkerpop via REST

In the Tinkerpop or Titan documentation, all operations are based on a sample graph. How to creat a new empty graph to work on? I am programming in erlang connecting to Tinkergraph, planned to use Titan later in production. There is no erlang…
Teddy
  • 35
  • 8
0
votes
2 answers

OrientDB Edge Index via Java

Is there a way using the Java API to access an edge index in OrientDB to determine whether a edge with a given label exists in between two known vertices? Afaik tinkergraph is not exposing any methods for this? I believe that Neo4j is providing an…
Jotschi
  • 3,270
  • 3
  • 31
  • 52
-1
votes
1 answer

Gremlin Query to get longest common subsequence for a given source from the Azure Cosmos graph

lets assume I have got list of all longest common paths for given source say A using below query g.V().hasLabel('A').repeat(out()).until(__.not(out())).path().by('id') Result: [ { "objects": [ "k", "B", "C" ] }, { "objects": [ "A", "B", "E" ]…
-1
votes
1 answer

Should I declare GryoMapper as a static field?

Looked at the following code, it appears to be thread-safe. https://github.com/apache/tinkerpop/blob/master/gremlin-core/src/main/java/org/apache/tinkerpop/gremlin/structure/io/gryo/GryoMapper.java Hoping to use it like class Foo { private…
u07103
  • 287
  • 1
  • 4
  • 14
1 2
3