0 ×

Weakly Connected Components

Gradoop Integration for KNIME Workbench version 1.0.0.v201911212144 by Steffen Dienst

Computes the weakly connected components of a logical graph and returns them as graphs in a graph collection.

Uses the Flink Gelly scatter-gather implementation of the Weakly Connected Components algorithm. This implementation takes a comparable vertex value as initial component identifier (ID). Vertices propagate their current value in each iteration. Upon receiving component IDs from its neighbors, a vertex adopts a new component ID if its value is lower than its current component ID. The algorithm converges when vertices no longer update their component ID value or when the maximum number of iterations has been reached.


Maximum Iterations
Select the maximum number of iterations.

Input Ports

One single logical graph.

Output Ports

Collection of individual components.

Best Friends (Incoming)

Best Friends (Outgoing)


To use this node in KNIME, install Gradoop-Integration from the following update site:


You don't know what to do with this link? Read our NodePit Product and Node Installation Guide that explains you in detail how to install nodes to your KNIME Analytics Platform.

Wait a sec! You want to explore and install nodes even faster? We highly recommend our NodePit for KNIME extension for your KNIME Analytics Platform. Browse NodePit from within KNIME, install nodes with just one click and share your workflows with NodePit Space.


You want to see the source code for this node? Click the following button and we’ll use our super-powers to find it for you.