Describes graph layout algorithms.
In this section
- Overview of graph layout information
-
Gives the information for each graph layout algorithm.
-
- Determining the appropriate layout algorithm
-
Explains how to determine which graph layout is appropriate.
-
- Typical ways to choose a layout
-
Explains possible ways to choose a graph layout algorithm.
-
- Generic parameters and features
-
Describes the support for generic features and parameters provided by each layout algorithm.
-
- Layout characteristics
-
Describes the effect of settings on each layout algorithm.
-
- Force-directed (FL)
-
Describes the Force-directed Layout algorithm.
-
- Tree Layout (TL)
-
Describes the Tree Layout algorithm.
-
- Hierarchical Layout (HL)
-
Describes the Hierarchical Layout algorithm.
-
- Link layout (LL)
-
Describes the Link Layout algorithms.
-
- Random layout (RL)
-
Describes the Random layout algorithm.
-
- Circular layout (CL)
-
Describes the Circular Layout algorithm.
-
- Grid layout (GL)
-
Describes the Grid layout algorithm.
-
- Common features of layouts that are subclasses of Basic Link
Style Layout
-
Describes features that are shared by some of the layouts only; these layouts are subclasses of the class that supports the Basic Link Style Layout.
-
Current section