All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
EdgeScore.h
Go to the documentation of this file.
1 /*
2  * EdgeScore.h
3  *
4  * Created on: 18.08.2015
5  * Author: Gerd Lindner
6  */
7 
8 #ifndef EDGESCORE_H_
9 #define EDGESCORE_H_
10 
11 #include "../graph/Graph.h"
12 #include "../base/Algorithm.h"
13 #include <vector>
14 
15 namespace NetworKit {
19 template<typename T>
20 class EdgeScore : public Algorithm {
21 
22 public:
23 
24  EdgeScore(const Graph& G);
25 
27  virtual void run();
28 
32  virtual std::vector<T> scores() const;
33 
36  virtual T score(edgeid eid);
37 
40  virtual T score(node u, node v);
41 
42 protected:
43  const Graph& G;
44  std::vector<T> scoreData;
45 
46 };
47 
48 }
49 
50 
51 #endif /* EDGESCORE_H_ */
std::vector< T > scoreData
Definition: EdgeScore.h:44
index edgeid
Definition: Globals.h:25
virtual void run()
Compute the edge score.
Definition: EdgeScore.cpp:21
const Graph & G
Definition: EdgeScore.h:43
EdgeScore(const Graph &G)
Definition: EdgeScore.cpp:13
virtual T score(edgeid eid)
Get the edge score of the edge with the given edge id.
Definition: EdgeScore.cpp:40
virtual std::vector< T > scores() const
Get a vector containing the score for each edge in the graph.
Definition: EdgeScore.cpp:30
index node
Definition: Globals.h:23
Definition: Algorithm.h:9
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79
Abstract base class for an edge score.
Definition: EdgeScore.h:20