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

Interface com.yworks.yfiles.layout.grouping.GroupingKeys defines look-up keys that are used to register data providers with grouped 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 grouped graphs rely on the grouping information to be properly bound to a given input graph.)

Related Documentation

See the yFiles FLEX Developer's Guide (Analysis and Layout Part) section Working with the Layout Graph Structure for a brief discussion of layout preparation of grouped graphs.

---

	Interface	Description
	GroupBoundsCalculator	Implementations of this interface are responsible for calculating the bounds of a group node during a layout process.

	Class	Description
	FixedGroupLayoutStage	A layout stage for hierarchically grouped graphs.
	GraphGrouping	Instances of this class can be used by algorithms to efficiently query the structure of such type of graphs.
	GroupingKeys	This interface defines data provider keys for those layout algorithms that can handle hierarchically grouped graphs.
	GroupNodeHider	A layout stage for hierarchically grouped graphs.
	InsetsGroupBoundsCalculator	Convenience implementation which allows for custom insets for each group node.
	IsolatedGroupComponentLayouter	A special component layouter that handles hierarchically grouped graphs in a special way.
	MinimumSizeGroupBoundsCalculator	This subclass of com.yworks.yfiles.layout.grouping.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.
	ParentEdgeAugmentationStage	This class can be used as a decorating stage for layout algorithms that cannot handle node groups.
	RecursiveGroupLayouter	Recursively traverses a hierarchically organized graph in a bottom-up fashion and applies the given layout algorithm (i.e.