There are 19 nodes that can be used as predessesor for a node with an input port of type LogicalGraph.
Hyperlink-Induced Topic Search computes two interdependent scores for every vertex in a directed graph.
Label Propagation algorithm to detect communities in a logical graph.
User defined flink/gradoop source code to transform a logical graph.
Computation of the PageRank scores for the connected vertices in a logical graph.
Create a reduce on edges neighborhood function on a logical graph.
Creates a reduce on neighbor neighborhood function on a logical graph.
Single-Source Shortest-Path computes the shortest path from a source vertex to all other vertices of a logical graph.
Extracts a subgraph from a logical graph using the given filter functions.
Arbitrary transformations of graph elements using user defined functions written in JAVA.
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 botsin.space/@nodepit on Mastodon.
Please note that this is only about NodePit. We do not provide general support for KNIME — please use the KNIME forums instead.