All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Overlapper.h
Go to the documentation of this file.
1 /*
2  * Overlapper.h
3  *
4  * Created on: 30.10.2012
5  * Author: Christian Staudt (christian.staudt@kit.edu)
6  */
7 
8 #ifndef OVERLAPPER_H_
9 #define OVERLAPPER_H_
10 
11 #include <set>
12 #include <vector>
13 
14 #include "../graph/Graph.h"
15 #include "../structures/Partition.h"
16 
17 namespace NetworKit {
18 
19 
24 class Overlapper {
25 
26 public:
27 
28  virtual Partition run(const Graph& G, const std::vector<Partition>& clusterings) = 0;
29 
30 };
31 
32 } /* namespace NetworKit */
33 #endif /* OVERLAPPER_H_ */
virtual Partition run(const Graph &G, const std::vector< Partition > &clusterings)=0
Abstract base class for algorithms which determine the overlap of multiple partitions.
Definition: Overlapper.h:24
Implements a partition of a set, i.e.
Definition: Partition.h:31
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79