All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
LocalMaxMatcher.h
Go to the documentation of this file.
1 /*
2  * ParallelMatcher.h
3  *
4  * Created on: 05.12.2012
5  * Author: Christian Staudt (christian.staudt@kit.edu)
6  */
7 
8 #ifndef PARALLELMATCHER_H_
9 #define PARALLELMATCHER_H_
10 
11 #include <set>
12 #include <algorithm>
13 
14 #include "Matcher.h"
15 
16 namespace NetworKit {
17 
18 
25 public:
26 
27  LocalMaxMatcher(const Graph& G);
28 
29 
30  virtual void run();
31 
32 protected:
33 
34 };
35 
36 } /* namespace NetworKit */
37 #endif /* PARALLELMATCHER_H_ */
LocalMaxMatcher(const Graph &G)
Definition: LocalMaxMatcher.cpp:11
Abstract base class for matching algorithms.
Definition: Matcher.h:21
LocalMax matching similar to the one described in the EuroPar13 paper by the Sanders group (Birn...
Definition: LocalMaxMatcher.h:24
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79
const Graph & G
Definition: Matcher.h:23
virtual void run()
Run the matching algorithm on the stored graph and return a matching.
Definition: LocalMaxMatcher.cpp:20