Package org.eclipse.gef.layout.algorithms
package org.eclipse.gef.layout.algorithms
This package provides different implementations of concrete layout
algorithms. There are a couple of simple algorithms that arrange nodes in a
grid (
GridLayoutAlgorithm), a
single column or row (
BoxLayoutAlgorithm), or which
simply prevent overlapping of nodes (
HorizontalShiftAlgorithm).-
ClassDescriptionLayout algorithm that places all elements in one column or one row, depending on set orientation.The
CompositeLayoutAlgorithmcombines multipleILayoutAlgorithms.TheGridLayoutAlgorithmlays out nodes in a grid.This layout shifts overlapping nodes to the right.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.Layout algorithm implementing SpaceTree.The SpringLayoutAlgorithm has its own data repository and relation repository.The SugiyamaLayoutAlgorithm class implements an algorithm to arrange a directed graph in a layered tree-like layout.An interface for heuristics that reduces edge crossings.Processing the nodes based on depth first search and creating a list of layersSpecifies the direction for theSugiyamaLayoutAlgorithm.Implemented the CrossingReducer interface.An interface for creating layers.Structure to store nodes and their positions in the layers.Implements the CrossingReducer interface.The TreeLayoutAlgorithm class implements a simple algorithm to arrange graph nodes in a layered tree-like layout.A helper class for layout algorithms that are based on tree structure.A superclass for listeners that can be added to this observer to get notification whenever the tree structure changes.Represents a node in a tree structure and stores all information related to it.TreeLayoutObserveruses instance of this class to create instances ofTreeLayoutHelper.TreeNode.