Class DynBetweennessOneNode¶

Inheritance Relationships¶

Class Documentation¶

class DynBetweennessOneNode : public NetworKit::Algorithm, public NetworKit::DynAlgorithm¶

Dynamic betweenness of a single node.

Public Functions

DynBetweennessOneNode(Graph &G, node x)¶

Creates the object for G.

Parameters:

G – The graph. @paarm x The node for which we want to compute betweenness.

virtual void run() override¶

initialize distances and Pred by repeatedly running the Dijkstra2 algorithm

virtual void update(GraphEvent event) override¶

Updates the betweenness centrality of x after an edge insertions on the graph. Notice: it works only with edge insertions.

Parameters:

e – The edge insertions.

virtual void updateBatch(const std::vector<GraphEvent> &batch) override¶

Updates the betweenness centrality of x after a batch of edge insertions on the graph. Notice: it works only with edge insertions.

Parameters:

batch – The batch of edge insertions.

edgeweight computeScore(GraphEvent event)¶

Returns the new betweenness score of node x after the insertion of an edge. Distances and scores of the other nodes are not changed by this function.

edgeweight getDistance(node u, node v)¶

edgeweight getSigma(node u, node v)¶

edgeweight getSigmax(node u, node v)¶

edgeweight getbcx()¶