All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Luby.h
Go to the documentation of this file.
1 /*
2  * Luby.h
3  *
4  * Created on: 27.02.2013
5  * Author: Christian Staudt (christian.staudt@kit.edu)
6  */
7 
8 #ifndef LUBY_H_
9 #define LUBY_H_
10 
11 #include "IndependentSetFinder.h"
12 
13 
14 namespace NetworKit {
15 
21 class [[deprecated]]
23 
24 public:
25 
26  // FIXME: check correctness of implementation
27  std::vector<bool> run(const Graph& G) override;
28 
29  std::string toString() const override;
30 };
31 
32 } /* namespace NetworKit */
33 #endif /* LUBY_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
DEPRECATED: put into code archive as nobody seems to be using it Luby's parallel independent set algo...
Definition: Luby.h:21
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