When I first saw this questions my reaction was this is graph matching.
Sadly our graph-matching component didn't support multiple anchor nodes. Now
it does.
So one way you would do this now is:
PatternNode p1 = new PatternNode();
p1.setAssociation( n1 );
PatternNode p2 = new PatternNode();
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
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),
3 matches
Mail list logo
