All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
GCE.h
Go to the documentation of this file.
1 /* GCE.h
2  *
3  * Created on: 06.05.2013
4  * Author: cls
5  */
6 
7 
8 #ifndef GCE_H_
9 #define GCE_H_
10 
11 #include <unordered_set>
12 
14 #include "../auxiliary/SetIntersector.h"
15 
16 
17 namespace NetworKit {
18 
19 
26 
27 public:
28 
29  GCE(const Graph& G, std::string objective);
30 
31 
32  std::map<node, std::set<node> > run(const std::set<node>& seeds) override;
33 
39  std::set<node> expandSeed(node s);
40 
41 protected:
42 
43  std::string objective; // name of objective function
44 
45 
46 };
47 
48 } /* namespace NetworKit */
49 #endif
std::string objective
Definition: GCE.h:43
const Graph & G
the input graph
Definition: SelectiveCommunityDetector.h:32
GCE(const Graph &G, std::string objective)
Definition: GCE.cpp:37
The Greedy Community Expansion algorithm.
Definition: GCE.h:25
std::map< node, std::set< node > > run(const std::set< node > &seeds) override
Detect communities for given seed nodes.
Definition: GCE.cpp:43
index node
Definition: Globals.h:23
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79
std::set< node > expandSeed(node s)
Definition: GCE.cpp:277
Definition: SelectiveCommunityDetector.h:18