This class implements a layout algorithm for drawing directed graphs in a hierarchic way.Namespace: yWorks.yFiles.Layout.Hierarchic
Assembly: yWorks.yFilesSilverlight.Algorithms (in yWorks.yFilesSilverlight.Algorithms.dll) Version: 184.108.40.206
This class implements a layout algorithm for drawing directed graphs in a hierarchic way. The algorithm places nodes in different horizontal layers, in such a way that most edges in the graph run from top to bottom. Here is a sample output of the algorithm using top to bottom orientation and Pendulum layout style. HierarchicLayouter can handle port constraints. See classes PortConstraint and PortConstraintKeys on how to setup port constraint information for this algorithm. HierarchicLayouter can consider edge label data when laying out a graph. That means that the layout of edge labels will be part of the resulting layout and the layout of nodes and edges is chosen in such a way that the edge labels do not conflict with the rest of the layout. See classes LabelLayoutData , LabelLayoutKeys , and LabelLayoutTranslator on how to setup the integrated edge labeling algorithm.