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.
Specifies whether or not to take the coordinates of the input diagram into account when arranging the nodes on the disk.
Specifies the minimum node distance this algorithm should enforce between all pairs of nodes.
Specifies how to place node labels.
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.