Client API. The Codename One framework your app is built on: this runs on the device, not in a backend.

public class RadialArrangement

  1. Object
  2. RadialArrangement

ImplementsGraphArrangement

A tree on rings: the root at the centre and each level on a circle around it, every subtree in a wedge as wide as its share of the leaves. Suits a mind map, or the neighbourhood of one node in a large network.

The tree is found the way TreeArrangement finds it. Rings grow apart as far as the outermost needs to fit its nodes without overlapping.

Constructors

public RadialArrangement()

Methods

public double getRingGap()The least distance between rings in world units.
public void setRingGap(double ringGap)Sets the least distance between rings.
public String getRootId()The id of the node at the centre, or null for the first node no edge enters.
public void setRootId(String rootId)Sets the node at the centre.
public ArrangementResult arrange(GraphModel model)Computes a position for every node, and a route for edges the arrangement bends.

Inherited methods

From Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait, clone, finalize

Constructor details

RadialArrangement

public RadialArrangement()

Method details

getRingGap

public double getRingGap()
The least distance between rings in world units.

setRingGap

public void setRingGap(double ringGap)
Sets the least distance between rings.

getRootId

public String getRootId()
The id of the node at the centre, or null for the first node no edge enters.

setRootId

public void setRootId(String rootId)
Sets the node at the centre.

arrange

public ArrangementResult arrange(GraphModel model)
Computes a position for every node, and a route for edges the arrangement bends.