All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
PathGrowingMatcher.h
Go to the documentation of this file.
1 /*
2  * PathGrowingMatcher.h
3  *
4  * Created on: Jun 13, 2013
5  * Author: Henning
6  */
7 
8 #ifndef PATHGROWINGMATCHER_H_
9 #define PATHGROWINGMATCHER_H_
10 
11 #include "Matcher.h"
12 #include "Matching.h"
13 
14 namespace NetworKit {
15 
24 public:
28  PathGrowingMatcher(const Graph& G);
29 
33  PathGrowingMatcher(const Graph& G, const std::vector<double>& edgeScores);
34 
40  virtual void run();
41 };
42 
43 } /* namespace NetworKit */
44 #endif /* PATHGROWINGMATCHER_H_ */
virtual void run()
Runs path growing algorithm to compute approximate maximum weight matching for graph G...
Definition: PathGrowingMatcher.cpp:26
PathGrowingMatcher(const Graph &G)
Definition: PathGrowingMatcher.cpp:13
Abstract base class for matching algorithms.
Definition: Matcher.h:21
Path growing matching algorithm as described by Hougardy and Drake, http://dx.doi.org/10.1016/S0020-0190(02)00393-9 Computes an approximate maximum weight matching with guarantee 1/2.
Definition: PathGrowingMatcher.h:23
const std::vector< double > edgeScores
Definition: Matcher.h:26
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79
const Graph & G
Definition: Matcher.h:23