Class DynWeaklyConnectedComponents¶

Inheritance Relationships¶

Class Documentation¶

class DynWeaklyConnectedComponents : public NetworKit::ComponentDecomposition, public NetworKit::DynAlgorithm¶

Determines and updates the weakly connected components of a directed graph.

Public Functions

DynWeaklyConnectedComponents(const Graph &G)¶

Create DynWeaklyConnectedComponents class for Graph G.

Parameters:

G – The graph.

~DynWeaklyConnectedComponents() override¶

virtual void run() override¶

This method determines the weakly connected components for the graph given in the constructor.

virtual void update(GraphEvent event) override¶

Updates the weakly connected components after an edge insertion or deletion.

Parameters:

event – [in] The event that happened (edge insertion or deletion).

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

Updates the weakly connected components after a batch of edge events (insertions or deletions).

Parameters:

batch – [in] A vector that contains a batch of edge events (insertions or deletions).