All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
PermanenceCentrality.h
Go to the documentation of this file.
1 #ifndef PERMANENCECENTRALITY_H
2 #define PERMANENCECENTRALITY_H
3 
4 #include "Centrality.h"
5 #include "../structures/Partition.h"
6 
7 namespace NetworKit {
8 
9 // TODO documentation completely missing!
11 public:
12  PermanenceCentrality(const Graph &G, const Partition &P);
13  void run();
14  double getPermanence(node u);
15  double getIntraClustering(node u);
16 private:
17  const Graph &G;
18  const Partition &P;
19  std::vector<index> inBegin;
20  std::vector<node> inEdges;
21  std::vector<bool> marker;
22 };
23 
24 
25 }
26 
27 #endif // PERMANENCECENTRALITY_H
double getPermanence(node u)
Definition: PermanenceCentrality.cpp:140
Implements a partition of a set, i.e.
Definition: Partition.h:31
index node
Definition: Globals.h:23
PermanenceCentrality(const Graph &G, const Partition &P)
Definition: PermanenceCentrality.cpp:9
Definition: Algorithm.h:9
Definition: PermanenceCentrality.h:10
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79
double getIntraClustering(node u)
Definition: PermanenceCentrality.cpp:110
void run()
The generic run method which calls runImpl() and takes care of setting to the appropriate value...
Definition: PermanenceCentrality.cpp:12