I am searching for a great graph database for locating set crossing points -- taking any two nodes and searching at whether their edge endpoints "overlap." Social networking example could be two take a look at a couple and find out whether or not they are are attached to the same people.

I have attempted to obtain FlockDB (in the folks at Twitter) working, because intersection functions are built-in, but found there wasn't much when it comes to user community/support. So any recommendations of other graph databases, especially in which the type of intersection functionality I am searching for already is available...?

This code is a touch rough and it is much simpler to convey in Cypher (obtained from the Cheet Sheet within the Neo4J Server console (fantastic way to have fun with Neo4J once you populate a database):