All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
ChibaNishizekiTriangleEdgeScore.h
Go to the documentation of this file.
1 /*
2  * ChibaNishizekiTriangleEdgeScore.h
3  *
4  * Created on: 22.05.2014
5  * Author: Gerd Lindner
6  */
7 
8 #ifndef CHIBANISHIZEKITRIANGLEEDGESCORE_H_
9 #define CHIBANISHIZEKITRIANGLEEDGESCORE_H_
10 
11 #include "../graph/Graph.h"
12 #include "EdgeScore.h"
13 
14 namespace NetworKit {
15 
22 
23 public:
24 
26  virtual count score(edgeid eid) override;
27  virtual count score(node u, node v) override;
28  virtual void run() override;
29 };
30 
31 } /* namespace NetworKit */
32 
33 #endif /* CHIBANISHIZEKITRIANGLEEDGESCORE_H_ */
index edgeid
Definition: Globals.h:25
const Graph & G
Definition: EdgeScore.h:43
ChibaNishizekiTriangleEdgeScore(const Graph &G)
Definition: ChibaNishizekiTriangleEdgeScore.cpp:14
virtual count score(edgeid eid) override
Get the edge score of the edge with the given edge id.
Definition: ChibaNishizekiTriangleEdgeScore.cpp:104
virtual void run() override
Compute the edge score.
Definition: ChibaNishizekiTriangleEdgeScore.cpp:17
uint64_t count
Definition: Globals.h:21
index node
Definition: Globals.h:23
An implementation of the triangle counting algorithm by Chiba/Nishizeki.
Definition: ChibaNishizekiTriangleEdgeScore.h:21
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79
Abstract base class for an edge score.
Definition: EdgeScore.h:20