All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
DissimilarityMeasure.h
Go to the documentation of this file.
1 /*
2  * DissimilarityMeasure.h
3  *
4  * Created on: 19.01.2013
5  * Author: Christian Staudt (christian.staudt@kit.edu)
6  */
7 
8 #ifndef DISSIMILARITYMEASURE_H_
9 #define DISSIMILARITYMEASURE_H_
10 
11 #include "../structures/Partition.h"
12 #include "../structures/Cover.h"
13 
14 namespace NetworKit {
15 
16 
22 
23 public:
24 
25  virtual double getDissimilarity(const Graph& G, const Partition& first, const Partition& second) = 0;
26 
27 
28  virtual double getDissimilarity(const Graph &G, const Cover &first, const Cover &second);
29 };
30 
31 } /* namespace NetworKit */
32 #endif /* DISSIMILARITYMEASURE_H_ */
virtual double getDissimilarity(const Graph &G, const Partition &first, const Partition &second)=0
Base class for all clustering dissimilarity measures.
Definition: DissimilarityMeasure.h:21
Implements a cover of a set, i.e.
Definition: Cover.h:27
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