I looked at the benchmark report of Tigergraph and thought to move from our Neo4j database.
I want to implement a traversing algorithm for my use and also want to use random values to choose which node to traverse. How can I do this in Tigergraph.
Alternatively, what is the solution for neo4j traversal api in Tigergraph.
Could you please be more specific on using random values to choose which node to traverse.
Do you just choose one node or multiple? How do you use the random value?
Is it like return a random float between 0 and 1, and when it is larger than a certain threshold the vertex will be selected?
In TigerGraph the traversal logic is implemented in GSQL. All Cypher logic can be equivalently translated into GSQL. Here are some resource for learning GSQL: