Defined in File DynApproxBetweenness.hpp
public NetworKit::Centrality
(Class Centrality)
public NetworKit::DynAlgorithm
(Class DynAlgorithm)
Interface for dynamic approximated betweenness centrality algorithm.
Public Functions
Implementation from the algorithm from “Approximating Betweenness Centrality in Fully-dynamic
Networks” from Internet Mathematics vol. 5 by Elisabetta Bergamini and Henning Meyerhenke approximates the betweenness of all vertices so that the scores are within an additive error
epsilon with probability at least (1- delta). The values are normalized by default.G – the graph
storePredecessors – keep track of the lists of predecessors?
epsilon – maximum additive error
delta – probability that the values are within the error guarantee
universalConstant – the universal constant to be used in computing the sample size. It is 0.5 by default.
Runs the static approximated betweenness centrality algorithm on the initial graph.
Updates the betweenness centralities after an edge insertions on the graph.
e – The edge insertion or deletion.
Updates the betweenness centralities after a batch of edge insertions on the graph.
batch – The batch of edge insertions and/or deletions.