The nodes are arranged on a disk such that the disk’s radius is minimized. The layout mostly optimizes the dense placement of the nodes, while edges play a minor role (i.e., there is no edge-routing). Hence, the compact disk layout is mostly suitable for graphs with small components whose loosely connected nodes should be grouped and packed in a small area.
Use Drawing As Sketch
Specifies whether or not to take the coordinates of the input diagram into account when arranging the nodes on the disk.
Minimum Node Distance
Specifies the minimum node distance this algorithm should enforce between all pairs of nodes.
Specifies how to place node labels.
- Automatic node labeling is deactivated.
- All node labels are placed horizontally centered on the corresponding node. There will be no overlaps between node labels and other graph elements.
- Consider Position
- The algorithm considers the current position of the node labels, i.e., the node labels keep their relative position and do not overlap with other graph elements.
Determines the type of the nodes. The algorithm takes the types into account instead of the connected components. In particular, nodes of the same type are placed closely together forming a visual component.
- The nodes have no types.
- Defined by Color
- The type is defined by the node color. Nodes with the same color have the same type.
- Defined by Label
- The type is defined by the node label. Nodes with the same label have the same type.