Balloon layout requires a tree or a collection of trees as its input. The tree will be routed in a quasi-radial style which we call balloon style. This is a good choice for undirected, dense, or huge trees with a high number of nodes on a single hierarchy level. Note: If the input is a general graph (not a tree), the layout is applied to a spanning tree of the graph.
Determines which node should be used as root of the tree.
Determines the routing style for all non-tree edges if the input graph is a general graph (not a tree).
(Note: Tree and non-tree edges are determined automatically.)
Determines how tightly the edges are merged/bundled for Routing Style for
Non-Tree Edges Bundled
. The higher this value, the stronger
the connection of the bundled edges.
Whether or not to act on selected nodes and edges that are connected to selected nodes only.
This setting determines the angular range of the sector that will be reserved for the children of a node. The possible angluar range lies between 1 and 359. The remaining angular range (360-x) will be automatically used to accommodate the edge that connects to the root node.
The smaller the chosen value, the more one will gain the impression that the nodes drive away from their root nodes and the center of the graph.
Generally speaking, the compactness of the layout will decrease with smaller values. Very small values will lead to layouts that consume a lot of space.
This setting determines the angular range of the sector that will be reserved around the root node of the graph to accommodate the attached subtrees.
Determines the minimal length of an edge.
This parameter influences the length of the tree-edges as it is computed by the layouter. The smaller the compactness factor, the shorter the tree-edges and the more compact the overall layout. The bigger the compactness factor the more difficult, and hence slower, the layout computation.
If activated, this option further increases compactness of the resulting layout but may introduce slight node overlaps.
Determines the type of the nodes. The type of the nodes is used as a criterion for sorting the child nodes of a local root node, with the effect that nodes of the same type are placed consecutively, if possible.
If activated, the original circular order of child nodes around each parent node will be maintained.
If activated, the children (successors) of each node in the tree will possibly be placed in an interleaved fashion, i.e., such that the successors of a node are placed at different distances in an alternating way. Enabling this option may produce more compact results for large graphs. Note that if there is enough space within the desired child wedge of a node all children may be placed without interleaving.
Specifies whether chains within the graph shall be drawn straight or not. Straightening all chains may lead to smoother, more symmetric results.
If activated, edge labels will be placed by the layout algorithm. Note that this option only works for edge labels with a free edge label model. Hence, all edge labels automatically receive such a model.
Specifies how to place node labels.