All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
EdgeScoring.h
Go to the documentation of this file.
1 /*
2  * EdgeScoring.h
3  *
4  * Created on: 15.10.2012
5  * Author: Christian Staudt (christian.staudt@kit.edu)
6  */
7 
8 #ifndef EDGESCORING_H_
9 #define EDGESCORING_H_
10 
11 #include "../graph/Graph.h"
12 
13 namespace NetworKit {
14 
15 
20 template<typename T>
21 class EdgeScoring {
22 
23 protected:
24 
25  Graph* G;
26 
27 public:
28 
30 
31  virtual ~EdgeScoring();
32 
33  virtual void scoreEdges(int attrId) = 0;
34 
35  virtual T edgeScore(node u, node v) const = 0;
36 };
37 
38 
39 template<typename T>
41  this->G = &G;
42 }
43 
44 template<typename T>
46 
47 }
48 
49 
50 } /* namespace NetworKit */
51 #endif /* EDGESCORING_H_ */
virtual ~EdgeScoring()
Definition: EdgeScoring.h:45
Abstract base class for algorithms associating a score with an edge.
Definition: EdgeScoring.h:21
Graph * G
pointer to the graph
Definition: EdgeScoring.h:25
index node
Definition: Globals.h:23
virtual T edgeScore(node u, node v) const =0
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79
EdgeScoring(Graph &G)
Definition: EdgeScoring.h:40
virtual void scoreEdges(int attrId)=0