The result of a aggregate run is a hierarchical nested clustering structure.
Remarks
Such a structure can be modeled by a directed tree which we encode by means of a set of AggregationInfo instances.
More precisely, each node of the original graph is mapped to a unique AggregationInfo instance. The mapping is stored in the INodeMap that is passed to method aggregate. Each AggregationInfo has a reference to its parent which induces a tree structure. There is always exactly one AggregationInfo 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 AggregationInfo instances that are not associated with a node of the original graph. These instances always represent an inner element of the tree structure.
Type Details
- yfiles module
- algorithms
- yfiles-umd modules
- All layout modules, view-layout-bridge
- Legacy UMD name
- yfiles.algorithms.AggregationInfo
Properties
Gets 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.
Gets the parent info of this info.