All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
MatchingCoarsening.h
Go to the documentation of this file.
1 /*
2  * MatchingCoarsening.h
3  *
4  * Created on: 30.10.2012
5  * Author: Christian Staudt (christian.staudt@kit.edu)
6  */
7 
8 #ifndef MATCHINGCONTRACTER_H_
9 #define MATCHINGCONTRACTER_H_
10 
11 #include "GraphCoarsening.h"
12 
13 #include "../matching/Matching.h"
14 
15 namespace NetworKit {
16 
22 
23 public:
24  MatchingCoarsening(const Graph& G, const Matching& M, bool noSelfLoops = false);
25 
35  virtual void run();
36 
37 private:
38  const Matching& M;
39  bool noSelfLoops;
40 };
41 
42 } /* namespace NetworKit */
43 #endif /* MATCHINGCONTRACTER_H_ */
Coarsens graph according to a matching.
Definition: MatchingCoarsening.h:21
MatchingCoarsening(const Graph &G, const Matching &M, bool noSelfLoops=false)
Definition: MatchingCoarsening.cpp:12
Abstract base class for graph coarsening/contraction algorithms.
Definition: GraphCoarsening.h:20
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79
const Graph & G
Definition: GraphCoarsening.h:43
virtual void run()
Contracts graph according to a matching.
Definition: MatchingCoarsening.cpp:16
Definition: Matching.h:19