All Classes
-
All Classes Interface Summary Class Summary Enum Summary Class Description BoxLayoutAlgorithm Layout algorithm that places all elements in one column or one row, depending on set orientation.CompositeLayoutAlgorithm TheCompositeLayoutAlgorithm
combines multipleILayoutAlgorithm
s.GridLayoutAlgorithm TheGridLayoutAlgorithm
lays out nodes in a grid.HorizontalShiftAlgorithm This layout shifts overlapping nodes to the right.ILayoutAlgorithm An interface for all layout algorithms.ILayoutFilter AnILayoutFilter
can be used to filter layout objects, so that they are not reported to anyILayoutAlgorithm
.LayoutContext TheLayoutContext
provides the context in which to layout aGraph
.LayoutProperties LayoutProperties
contains all properties which can be accessed onGraph
,Edge
,Node
, their default values, as well as static accessor methods for those properties.RadialLayoutAlgorithm This layout will take the given entities, apply a tree layout to them, and then display the tree in a circular fashion with the roots in the center.SpaceTreeLayoutAlgorithm Layout algorithm implementing SpaceTree.SpringLayoutAlgorithm The SpringLayoutAlgorithm has its own data repository and relation repository.SugiyamaLayoutAlgorithm The SugiyamaLayoutAlgorithm class implements an algorithm to arrange a directed graph in a layered tree-like layout.SugiyamaLayoutAlgorithm.BarycentricCrossingReducer SugiyamaLayoutAlgorithm.CrossingReducer An interface for heuristics that reduces edge crossings.SugiyamaLayoutAlgorithm.DFSLayerProvider Processing the nodes based on depth first search and creating a list of layersSugiyamaLayoutAlgorithm.Direction Specifies the direction for theSugiyamaLayoutAlgorithm
.SugiyamaLayoutAlgorithm.GreedyCrossingReducer Implemented the CrossingReducer interface.SugiyamaLayoutAlgorithm.LayerProvider An interface for creating layers.SugiyamaLayoutAlgorithm.NodeWrapper Structure to store nodes and their positions in the layers.SugiyamaLayoutAlgorithm.SimpleLayerProvider SugiyamaLayoutAlgorithm.SplitCrossingReducer Implements the CrossingReducer interface.TreeLayoutAlgorithm The TreeLayoutAlgorithm class implements a simple algorithm to arrange graph nodes in a layered tree-like layout.TreeLayoutHelper A helper class for layout algorithms that are based on tree structure.TreeLayoutHelper.TreeListener A superclass for listeners that can be added to this observer to get notification whenever the tree structure changes.TreeLayoutHelper.TreeNode Represents a node in a tree structure and stores all information related to it.TreeLayoutHelper.TreeNodeFactory TreeLayoutObserver
uses instance of this class to create instances ofTreeLayoutHelper.TreeNode
.