This node is currently not available in KNIME v5.1 — instead we’re showing this page for KNIME v4.7. You can use the version menu in the title bar to permanently switch your preferred version. This will also show the link to the update site.
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.
Options
Views
- This node has no views
Workflows
- No workflows found
Links
- No links available
Developers
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.