Class DynBetweenness¶

Inheritance Relationships¶

Class Documentation¶

class DynBetweenness : public NetworKit::Centrality, public NetworKit::DynAlgorithm¶

Dynamic APSP.

Public Functions

DynBetweenness(const Graph &G)¶

Creates the object for G.

Parameters:

G – The graph.

virtual void run() override¶

Runs static betweenness centrality algorithm on the initial graph.

virtual void update(GraphEvent e) override¶

Updates the betweenness centralities 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 centralities after a batch of edge insertions on the graph. Notice: it works only with edge insertions.

Parameters:

batch – The batch of edge insertions.

count visPairs()¶

Returns number of visited pairs

edgeweight getDistance(node u, node v)¶

edgeweight getSigma(node u, node v)¶

count numAffectedAPSP()¶

count numAffectedDep()¶

double getTimeDep()¶