Provides several methods for generating special clusterings. More...
#include <ClusteringGenerator.h>
Public Member Functions  
virtual Partition  makeSingletonClustering (Graph &G) 
Make a singleton clustering of Graph G, i.e. More...  
virtual Partition  makeOneClustering (Graph &G) 
Make a 1clustering of Graph G, i.e. More...  
virtual Partition  makeRandomClustering (Graph &G, count k) 
Make a clustering of Graph G with k clusters to which the nodes are randomly assigned. More...  
virtual Partition  makeContinuousBalancedClustering (Graph &G, count k) 
Make a clustering of Graph G with k clusters. More...  
virtual Partition  makeNoncontinuousBalancedClustering (Graph &G, count k) 
Make a clustering of a Graph G with k clusters. More...  
Provides several methods for generating special clusterings.

virtual 
Make a clustering of a Graph G with k clusters.
Each node u is assigned to cluster u % k. When the number of nodes n is quadratic and k is the square root of n, this clustering is complementary to the continuous balanced clustering in the sense that no pair of nodes that is in the same cluster in one of the clusterings is in the same cluster in the other clustering.
G  The graph. 
k  The amount of clusters. 