|
Class | Description | |
---|---|---|
![]() |
Implements algorithms for arranging tree structures. |
|
![]() |
Represents an edge connecting two vertices in a graph. |
|
![]() |
The FractalLayout tree layout algorithm places child nodes symmetrically around their parent node.Nodes at the lowest level are arranged directly in a circle around their parent. At the upper level,the already arranged nodes form branches that are arranged in a circle around the new parent node.The algorithm is recursively repeated till the highest level is reached. |
|
![]() |
Represents a graph. |
|
![]() |
Implements a layered graph layout algorithm. |
|
![]() |
Implements the Spring-Embedder graph layout algorithm. |
|
![]() |
Implements algorithms for arranging tree structures. |
|
![]() |
Represents a vertex in a graph. |
Enumeration | Description | |
---|---|---|
![]() |
Defines values that specify how automatic layout algorithms align links to anchor points. |
|
![]() |
Specifies the shape of the diagram links after they are laid out. |
|
![]() |
Specifies the shape of the diagram links after they are laid out. |