Defined in File DynBetweennessOneNode.hpp
public NetworKit::Algorithm
(Class Algorithm)
public NetworKit::DynAlgorithm
(Class DynAlgorithm)
Dynamic betweenness of a single node.
Public Functions
Creates the object for G.
G – The graph. @paarm x The node for which we want to compute betweenness.
initialize distances and Pred by repeatedly running the Dijkstra2 algorithm
Updates the betweenness centrality of x after an edge insertions on the graph. Notice: it works only with edge insertions.
e – The edge insertions.
Updates the betweenness centrality of x after a batch of edge insertions on the graph. Notice: it works only with edge insertions.
batch – The batch of edge insertions.
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.