Graph Clustering For Viewer

Computes a hierarchical clustering of a logical graph containing 2 levels. The hierarchy levels are written as separate logical graphs to the given path, each to a folder starting with 'level_', e.g. 'level_0' for the lowest level. The top level should have significantly fewer elements than the original graph, which helps to visually explore very big graphs with the Big Graph Viewer node.

The superordinate hierarchy level consists of super vertices, where each is a parent for a number of vertices from the next subordinate hierarchy level and holds references to its children. Vertices in a subordinate level are first assigned to a cluster. Vertices in a cluster are than grouped by label to preserve both, the structure and the semantics of the graph. Each group then forms a super vertex. All edges between super vertices are combined for each direction.

How well the top level elements are reduced depends on the original graph structure and the type of cluster assignment algorithm.