Assembly: yWorks.yFilesSilverlight.Algorithms (in yWorks.yFilesSilverlight.Algorithms.dll) Version: 184.108.40.206
A virtual tree structure is created for the graph whose root node is placed on the center of the circles. All children of a tree node are on a higher layer (i.e. larger circles) than their parent. A sector is calculated for each node so the sector of each child in the virtual tree is a sub-sector of its parent's sector. The radii of the circles are calculated taking the sector size needed by the whole subtree into account.
There are different center nodes policies that can be used to determine which nodes shall be placed on the center (single center node) or on the innermost circle (several center nodes). How the nodes are distributed over the circles can be specified by a layering strategy .
The way in which edges are routed in this layout is specified by an edge routing strategy . Note that the edge routing cannot always prevent node-edge overlaps.