This algorithm extracts the n largest (by number of nodes) weakly connec= ted components in the network. If n is given as zero, it extracts all weakl= y connected component. A weakly connected component is any set of nodes whe= re every node with a path to any of the nodes in the component is also in t= he component, and no node is in the component that does not have a path to = every other node in the component.

=20This is a simple algorithm, but it splits the network on an obvious and = unambiguous boundary. Of course, often these boundaries do not exist.

= =20Splitting up any network with weakly connected components for analysis a= nd/or visualization.

=20The JUNG weak component clustering algorithm is wrapped by this algorith= m

=20It is often useful to run this after an analysis that removes edges, suc= h as high degree node deletion or pathfinder network scaling. This algorith= m can help get a feel for the effect of the other algorithm, and create mor= e easily visualizable chunks from larger networks.

=20- =20
- Source Code =20

The license could not be verified: License Certificate has expired!=20
Generate a Free license now.