I have a graph with two types of nodes, lets call them G for groups and P for persons. Persons belongs to a group with, call that relation r1 and persons know other persons, call that r2.
I want to "project" the graph to a graph of only Groups with a link between them if there is a two person chain between them, i.e. if there is a path
I want this to show as
There might (is) tons of different such path between any groups with one path exists, but only interested in one.
Starting with a given group I've tried using the subgraphAll and expandConfig algorithms to do this. They work alright, but not quite.
expandConfig: gives me all the paths between Groups reachable from the start node with paths of the given type. Good, but takes quite a bit of time when the maxLevel goes up.
subgraphAll: When specifying the Group as a end node (using >Group) it is really fast and gives all the groups reachable in this way, but no relationships.
When not doing that it seems about as fast as expandConfig. Im also not entirely sure how to recreate the graph from this as the relationship list doesnt specify
which nodes the relationships are between?
Just to clarify, say the graph looks something like
(G 1)--(P 1)--(P 2)--(G 2)--(P 3)--(P 4)--(G 3)
then expandConfig gives a list containing: (G1)--(P1)--(P2)--(G2), (G1)--(P1)--(P5)--(G2), (G2)--(P3)--(P4)--(G3)
subgraphAll gives me [(G1), (P1), (P2), (P5),(G2), (P3), (P4), (G3)] and a list of relationships i really dunno what to do with
subgraphAll with endnodes just gives [(G1), (G2), (G3)]
subgraphAll with endnodes is really fast, and I am thinking that it has to find paths between the groups do its thing. Is there any way to get it to return just one of them?
Is there any other way to solve the problem fast?