Package com.jgalgo.alg.connect
Class KVertexConnectedComponentsWhiteMoody
java.lang.Object
com.jgalgo.alg.connect.KVertexConnectedComponentsAlgoAbstract
com.jgalgo.alg.connect.KVertexConnectedComponentsWhiteMoody
- All Implemented Interfaces:
KVertexConnectedComponentsAlgo
White-Moody algorithm for finding k-vertex-connected components in an undirected graph.
Based on 'Structural Cohesion and Embeddedness: A Hierarchical Concept of Social Groups' by White and Moody (2003).
- Author:
- Barak Ugav
-
Constructor Summary
ConstructorDescriptionCreate a new instance of the algorithm. -
Method Summary
Methods inherited from class com.jgalgo.alg.connect.KVertexConnectedComponentsAlgoAbstract
findKVertexConnectedComponents
-
Constructor Details
-
KVertexConnectedComponentsWhiteMoody
public KVertexConnectedComponentsWhiteMoody()Create a new instance of the algorithm.Please prefer using
KVertexConnectedComponentsAlgo.newInstance()
to get a default implementation for theKVertexConnectedComponentsAlgo
interface.
-