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.
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.
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 firstname.lastname@example.org, 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.