All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
HashingOverlapper.h
Go to the documentation of this file.
1 /*
2  * HashingOverlapper.h
3  *
4  * Created on: 31.01.2013
5  * Author: Christian Staudt (christian.staudt@kit.edu)
6  */
7 
8 #ifndef HASHINGOVERLAPPER_H_
9 #define HASHINGOVERLAPPER_H_
10 
11 #include <functional>
12 
13 #include "Overlapper.h"
14 
15 namespace NetworKit {
16 
22 
23 public:
24 
25  virtual Partition run(const Graph& G, const std::vector<Partition>& clusterings);
26 
27 };
28 
29 } /* namespace NetworKit */
30 #endif /* HASHINGOVERLAPPER_H_ */
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
Determines the overlap of multiple partitions by hashing partition identifiers.
Definition: HashingOverlapper.h:21
virtual Partition run(const Graph &G, const std::vector< Partition > &clusterings)
Definition: HashingOverlapper.cpp:14