16 nodes in this category and its subcategories
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 each node.
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.
Groups vertices/edges by labels/properties and calculates aggregations on those groups.
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.
Evaluates the given query using the Cypher query engine.