skip to main content
Programmer's documentation > Using graph layout algorithms > Layout algorithms
 
Layout algorithms
Describes graph layout algorithms.
*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.
*CSS: overview of layout algorithms
*Lists the layout algorithms available in CSS.
*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.
*Topological Mesh Layout (TML)
*Gives information on the Topological Mesh Layout (TML) algorithm (class IlvTopologicalMeshLayout from the package ilog.views.graphlayout.topologicalmesh).
*Uniform Length Edges (ULEL)
*Describes the Uniform Length Edges 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.
*Bus layout (BL)
*Describes the Bus Layout algorithm (class IlvBusLayout from the package ilog.views.graphlayout.bus).
*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.
*Layout exceptions
*Describes the exceptions that may be thrown when a layout is applied to the wrong type of graph or the wrong type of link and explains how to catch them.
Copyright © 2018, Rogue Wave Software, Inc. All Rights Reserved.