All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
SelectiveCommunityDetector.h
Go to the documentation of this file.
1 /*
2  * SelectiveCommunityDetector.h
3  *
4  * Created on: 15.05.2013
5  * Author: cls
6  */
7 
8 #ifndef SELECTIVECOMMUNITYDETECTOR_H_
9 #define SELECTIVECOMMUNITYDETECTOR_H_
10 
11 #include <unordered_set>
12 
13 #include "../auxiliary/Timer.h"
14 #include "../graph/Graph.h"
15 
16 namespace NetworKit {
17 
19 
20 public:
21 
23 
28  virtual std::map<node, std::set<node> > run(const std::set<node>& seeds) = 0;
29 
30 protected:
31 
32  const Graph& G;
33 };
34 
35 } /* namespace NetworKit */
36 #endif /* SELECTIVECOMMUNITYDETECTOR_H_ */
const Graph & G
the input graph
Definition: SelectiveCommunityDetector.h:32
virtual std::map< node, std::set< node > > run(const std::set< node > &seeds)=0
Detect communities for given seed nodes.
SelectiveCommunityDetector(const Graph &G)
Definition: SelectiveCommunityDetector.cpp:15
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79
Definition: SelectiveCommunityDetector.h:18