Class AffectedNodes¶

Inheritance Relationships¶

Class Documentation¶

class AffectedNodes : public NetworKit::Algorithm¶

Public Functions

AffectedNodes(const Graph &G, const GraphEvent &event)¶

Constructs the AffectedNodes class for a given graph G and a graph event event. The run() method computes the set of affected nodes, their distance to the edge modification and, in the case of an edge insertion, an upper bound for the improvement of the harmonic closeness centrality of each affected node.

Parameters:

• G – The graph.

• event – The graph event.

virtual void run() override¶

Computes the set of affected nodes.

std::vector<node> getNodes()¶

Returns the set of affected nodes.

Returns:

The set of affected nodes

std::vector<edgeweight> getDistances()¶

Returns the distances to the edge modification for each node.

Returns:

The distances to the edge modification for each node

std::vector<edgeweight> getImprovements()¶

Returns the level-based improvement bounds for each affected node.

Returns:

The improvement upper bound for each affected node, indexed by node ID

Public Members

edgeweight closenessU = 0¶

edgeweight closenessV = 0¶

edgeweight improvementU = 0¶

edgeweight improvementV = 0¶