All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
IndependentSetFinder.h
Go to the documentation of this file.
1 /*
2  * IndependentSetFinder.h
3  *
4  * Created on: 27.02.2013
5  * Author: Christian Staudt (christian.staudt@kit.edu)
6  */
7 
8 #ifndef INDEPENDENTSETFINDER_H_
9 #define INDEPENDENTSETFINDER_H_
10 
11 #include "../graph/Graph.h"
12 
13 namespace NetworKit {
14 
20 class [[deprecated]]
22 
23 
24 public:
25 
27  virtual ~IndependentSetFinder() = default;
28 
34  virtual std::vector<bool> run(const Graph& G) = 0;
35 
40  virtual std::string toString() const;
41 
48  bool isIndependentSet(const std::vector<bool>& set, const Graph& G) const;
49 
50 };
51 
52 } /* namespace NetworKit */
53 #endif /* INDEPENDENTSETFINDER_H_ */
std::string toString(const T &...args)
Definition: StringBuilder.h:266
class deprecated("Use MaximalCliques instead.")]] MaxClique
Exact algorithm for computing the size of the largest clique in a graph.
Definition: MaxClique.h:24
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79
DEPRECATED: put into code archive, nobody seems to be using it Abstract base class for independent se...
Definition: IndependentSetFinder.h:20