There are 4195 nodes that can be used as predessesor for a node with an input port of type.
Load graph data from a directory containing a file representing (labeled-)edge list.
Reads a graph collection from a GDL string.
Writes Gradoop graphs as CSV into a directory.
Writes Gradoop Graphs as Graphviz DOT into a file.
Computes a 2 level hierarchical clustering of a logical graph which can be explored with the Big Graph Viewer.
Counts all nodes and edges in the logical graph and adds these counts as attributes to the graph head.
Creates the union/intersection/difference of two logical graphs.
Calculates the vertex degree for each vertex of a logical graph: In-degree, out-degree and sum of both. Adds these informations as new properties to […]
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.
Takes a logical graph and picks a subset of vertices or edges from this graph.
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.