[Neo] PHP and Neo4j example taking shape

Hi there, Philip Rud has developed a great Neo4j-PHP integration using the PHP-Java-Bridge. I cleaned up the project a bit, the result is on http://github.com/peterneubauer/neo4j-php-wrapper/tree/master/all-in-one/ . This approach lets you using the Java interface from PHP via a special XML-RPC pro

Re: [Neo] Nodes commonly connected to a set of predefined nodes in a graph

Sounds fairly easy. To use your customer analogy, simply iterate on all nodes that have a "PurchasedProduct" relationship with the ProductX node (these will be customer nodes, based on the domain model), and iterate one level beyond the customer (e.g. other things they purchased)

[Neo] Nodes commonly connected to a set of predefined nodes in a graph

Hi, I am searching for an optimal way to find a commonly connected nodes to a set of nodes in a graph. Consider the case where n1, n2, n3, n4 ,n5 are 5 nodes in a graph. These 5 are connected to the other nodes. I need to find the nodes in the graph which are connected all above 5 nodes optimally