C

NodeAggregationInfo

The result of an aggregate run is a hierarchical nested clustering structure.
Inheritance Hierarchy

Remarks

Such a structure can be modeled by a directed tree which we encode by means of a set of NodeAggregationInfo instances.

More precisely, each node of the original graph is mapped to a unique NodeAggregationInfo instance. The mapping is stored in the IMapper<K, V> that is passed to method aggregate. Each NodeAggregationInfo has a reference to its parent which induces a tree structure. There is always exactly one NodeAggregationInfo without a parent that represents the root of the tree. Property nodesOnlyOnLeaves allows to specify whether nodes are only mapped to leaves of the tree structure or if they can also be mapped to inner nodes.

Note that there are NodeAggregationInfo instances that are not associated with a node of the original graph. These instances always represent an inner element of the tree structure.

This class cannot be instantiated

Members

No filters for this type

Properties

Gets the number of nodes of the original graph that are descendants of this aggregate.
readonlyfinal

Property Value

the number of nodes of the original graph that are descendants of this aggregate
Gets the sum of the weights of nodes of the original graph that are descendants of this aggregate.
The weight of a node corresponds to its custom weight (see NODE_WEIGHT_DATA_KEY) or, if no custom weights are specified, to its pageRank.
readonlyfinal

Property Value

the sum of the weights of nodes of the original graph that are descendants of this aggregate
Gets the maximum weight of a node of the original graph that is a descendant of this aggregate.
The weight of a node corresponds to its custom weight (see NODE_WEIGHT_DATA_KEY) or, if no custom weights are specified, to its pageRank.
readonlyfinal

Property Value

the maximum weight of a node of the original graph that is a descendant of this aggregate
Gets the parent info of this info.
readonlyfinal

Property Value