[Neo4j] Function to check whether two nodes are connected?

Hello there! First of all, thanks for the help in all my previous questions, all the answers have been helping me to use Neo4j with success. I have a very simple question, but I haven't found the answer yet... I'd like to have a function, which signature would be more or less like this:

Re: [Neo4j] Function to check whether two nodes are connected?

Easy: just one. For now, I've written this, but I'm still not sure it is the simplest way to write it public boolean areConnected(Node n1,Node n2,Relationship rel,Direction dir) throws Exception { IterableRelationship relationships = n1.getRelationships(dir); for

[Neo4j] Graph homomorphism vs. Graph traversal?

Hello all, I was thinking about the differences between Graph homomorphism and Graph traversal operations. Can anyone help me on that? I know that Graph homomorphism takes a data graph and a request graph as input. It is also easily possible to transform a graph traversal query into a graph

[Neo4j] Further information about Neo4J

Hello, My name is Bruno Paiva Lima da Silva, and I am a PhD student at LIRMM in Montpellier, France investigating graph-based conjunctive query answering. A very quick description of my thesis can be found at: [ http://bplsilva.com/en/ ] , or, for more details, please check my presentations