Provides classes and interfaces that are necessary for layout calculation of graph hierarchies (a.k.a.

Classes

  ClassDescription
Public classFixedGroupLayoutStage
A layout stage for hierarchically grouped graphs.
Public classGraphGrouping
Instances of this class can be used by algorithms to efficiently query the structure of such type of graphs.
Public classGroupingKeys
This interface defines data provider keys for those layout algorithms that can handle hierarchically grouped graphs.
Public classGroupNodeHider
A layout stage for hierarchically grouped graphs.
Public classInsetsGroupBoundsCalculator
Convenience implementation which allows for custom insets for each group node.
Public classIsolatedGroupComponentLayouter
A special component layouter that handles hierarchically grouped graphs in a special way.
Public classMinimumSizeGroupBoundsCalculator
This subclass of InsetsGroupBoundsCalculator does not only allow custom insets for each group node, but also makes sure to keep provided minimum sizes registered for each node that are provided through a DataProvider which must be registered with the graph prior to the invocation of the layout algorithm.
Public classParentEdgeAugmentationStage
This class can be used as a decorating stage for layout algorithms that cannot handle node groups.
Public classRecursiveGroupLayouter
Recursively traverses a hierarchically organized graph in a bottom-up fashion and applies the given layout algorithm (i.e.

Interfaces

  InterfaceDescription
Public interfaceIGroupBoundsCalculator
Implementations of this interface are responsible for calculating the bounds of a group node during a layout process.

Enumerations

  EnumerationDescription
Public enumerationInterEdgeRoutingStyle
Inter-edge routing style specifier.

Remarks

Provides classes and interfaces that are necessary for layout calculation of graph hierarchies (a.k.a. hierarchically organized graphs).

Interface GroupingKeys defines look-up keys that are used to register data providers with hierarchically organized graphs. These data providers are expected to hold the grouping information, e.g., the parent-child relation of nodes, in a way that is understood by layout algorithms.
(Layout algorithms that are able to handle hierarchically organized graphs rely on the grouping information to be properly bound to a given input graph.)

Related Documentation

See the yFiles Developer's Guide section on Grouped Graph Setup for Layout for a brief discussion of layout preparation of grouped graphs.