All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
ClusteringGenerator.h
Go to the documentation of this file.
1 /*
2  * ClusteringGenerator.h
3  *
4  * Created on: 10.12.2012
5  * Author: Christian Staudt (christian.staudt@kit.edu)
6  */
7 
8 #ifndef CLUSTERINGGENERATOR_H_
9 #define CLUSTERINGGENERATOR_H_
10 
11 #include "../structures/Partition.h"
12 
13 namespace NetworKit {
14 
20 
21 public:
30 
38  virtual Partition makeOneClustering(Graph& G);
39 
40 
49 
50 
60 
72 };
73 
74 } /* namespace NetworKit */
75 #endif /* CLUSTERINGGENERATOR_H_ */
virtual Partition makeContinuousBalancedClustering(Graph &G, count k)
Make a clustering of Graph G with k clusters.
Definition: ClusteringGenerator.cpp:46
virtual Partition makeNoncontinuousBalancedClustering(Graph &G, count k)
Make a clustering of a Graph G with k clusters.
Definition: ClusteringGenerator.cpp:75
virtual Partition makeOneClustering(Graph &G)
Make a 1-clustering of Graph G, i.e.
Definition: ClusteringGenerator.cpp:21
Implements a partition of a set, i.e.
Definition: Partition.h:31
Provides several methods for generating special clusterings.
Definition: ClusteringGenerator.h:19
virtual Partition makeRandomClustering(Graph &G, count k)
Make a clustering of Graph G with k clusters to which the nodes are randomly assigned.
Definition: ClusteringGenerator.cpp:28
uint64_t count
Definition: Globals.h:21
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79
virtual Partition makeSingletonClustering(Graph &G)
Make a singleton clustering of Graph G, i.e.
Definition: ClusteringGenerator.cpp:14