All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
MaxClique.h
Go to the documentation of this file.
1 /*
2  * MaxClique.h
3  *
4  * Created on: 08.12.2014
5  * Author: Henning
6  */
7 
8 #ifndef MAXCLIQUE_H_
9 #define MAXCLIQUE_H_
10 
11 #include "../graph/Graph.h"
12 #include <unordered_set>
13 
14 
15 namespace NetworKit {
16 
17 
24 class [[deprecated("Use MaximalCliques instead.")]]
25 MaxClique {
26 protected:
27  const Graph& G;
28  count maxi;
29  std::unordered_set<node> bestClique;
30 
35  void clique(std::unordered_set<node>& U, std::unordered_set<node>& currClique, count size);
36 
37 public:
43  MaxClique(const Graph& G, count lb=0);
44 
51  void run();
52 
57  count getMaxCliqueSize();
58 
62  std::unordered_set<node> getMaxClique() const;
63 };
64 
65 } /* namespace NetworKit */
66 #endif /* MAXCLIQUE_H_ */
class deprecated("Use MaximalCliques instead.")]] MaxClique
Exact algorithm for computing the size of the largest clique in a graph.
Definition: MaxClique.h:24
uint64_t count
Definition: Globals.h:21
Algorithm for listing all maximal cliques.
Definition: MaximalCliques.h:27
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79