Fusion is a binary operator taking two graphs: a search graph (first parameter) and a pattern graph (second parameter) [This means that this is not a symmetric operator (F(a,b) != F(b,a))]. The general idea of this operator is that everything that appears in the pattern graph is fused into a single vertex into the search graph. A new logical graph is returned.

- If any search graph is empty, an empty result will always be returned
- If a pattern graph is empty, then the search graph will always be returned
- The vertices of the pattern graph appearing in the first parameter are replaced by a new vertex. The old edges of the search graph are updated in the final result so that each vertex, either pointing to a to-be-fused vertex or starting from a to-be-fused vertex, are respectively updated as either pointing or starting from the fused vertex.
- Pattern graph's edges are also taken into account: any edge between to-be-fused vertices appearing in the search graph that are not expressed in the pattern graph are rendered as hooks over the fused vertex

- This node has no views

- No workflows found

- No links available

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.

To use this node in KNIME, install the extension Gradoop-Integration from the below update site following our NodePit Product and Node Installation Guide:

v4.7

Do you have feedback, questions, comments about NodePit, want to support this platform, or want your own nodes or workflows listed here as well? Do you think, the search results could be improved or something is missing? Then please get in touch! Alternatively, you can send us an email to mail@nodepit.com, follow @NodePit on Twitter, or chat on Gitter!

**Please note that this is only about NodePit. We do not provide general support for KNIME — please use the KNIME forums instead.**