I have an undirected graph containing interacting pairs. This graph is huge.
I want to break the graph into clusters.
All I have is a list of interacting pairs eg.
1,2
1,4
2,3
3,4
4,7
7,8
7,10
8,9
9,10
In this example everything is linked. It could be made into 2 clusters however if we broke the connection between pairs 4 and 7 as this is the single link between hubs containing 1,2,3,4 and 7,8,9,10.
Is there some standard method for performing such I task. It has to be a common problem I imagine?
TIA
UPDATE: thanks, lots of useful stuff here.
Graph::undirected works a treat. One slight issue though. Each time I run the script I have to create the graph. The graph has ~50,000 edges which means it takes over 10 minutes to build. Is there some way of writing the graph to disk so that it can be loaded back into memory quicker that recreating the graph from fresh?
In reply to breaking up undirected graphs by nosbod
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |