| Package | Description |
|---|---|
| ilog.cpl.graph.graphlayout |
Contains the common implementation for the node and link layout
support for both the
IlpNetwork and IlpEquipment
components. |
| ilog.tgo.graphic.graphlayout |
Contains graph layout algorithms that extend those of package ilog.views.graphlayout.
|
| ilog.views.graphlayout |
A high-level, generic framework for the graph layout services provided
by JViews, which allows you to easily obtain readable representations
of graphs and networks.
|
| ilog.views.graphlayout.basic |
This package contains base classes for other layout algorithms.
|
| ilog.views.graphlayout.bus |
The Bus Layout algorithm is designed to display bus network
topologies, that is, a set of nodes connected to a
bus node.
|
| ilog.views.graphlayout.circular |
The Circular Layout algorithm displays graphs
representing interconnected ring and/or star network topologies.
|
| ilog.views.graphlayout.grid |
The Grid Layout arranges the nodes either in the cells of a matrix (grid), or by rows or columns.
|
| ilog.views.graphlayout.hierarchical |
The Hierarchical Layout algorithm arranges the nodes of the graph
in horizontal or vertical levels, so that the majority of the
links point in the same direction (top-down, left-to-right, and so on).
|
| ilog.views.graphlayout.link |
The Link Layout algorithm reshapes the links of a graph without
moving the nodes.
|
| ilog.views.graphlayout.link.longlink |
The Long Link Layout algorithm reshapes the links of a graph without
moving the nodes.
|
| ilog.views.graphlayout.link.shortlink |
The Short Link Layout algorithm reshapes the links of a graph without moving
the nodes.
|
| ilog.views.graphlayout.multiple |
The Multiple Layout class is not really a layout algorithm but rather a
facility to compose multiple layout algorithms and treat them as one algorithm
object.
|
| ilog.views.graphlayout.random |
The Random Layout algorithm moves the nodes of the graph at
randomly computed positions inside a user-defined region.
|
| ilog.views.graphlayout.recursive |
The Recursive Layout class is not really a layout algorithm but rather a
facility to traverse a nested graph containing subgraphs and perform
layouts recursively for each subgraph.
|
| ilog.views.graphlayout.springembedder |
The Spring Embedder Layout algorithm can be used to lay out
any type of graph.
|
| ilog.views.graphlayout.topologicalmesh |
The Topological Mesh Layout (TML) algorithm can be used to lay out
cyclic graphs, both planar and non-planar.
|
| ilog.views.graphlayout.tree |
The Tree Layout arranges the nodes of a tree horizontally, vertically or
radially, starting from the root of the tree.
|
| ilog.views.graphlayout.uniformlengthedges |
The Uniform Length Edges Layout algorithm can be used to
lay out any type of graph; it allows you to specify the length of the links.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
IlpSubnetworkPositionLayout.layout(boolean redraw) |
| Modifier and Type | Method and Description |
|---|---|
protected void |
IltStraightLinkLayout.layout(boolean redraw) |
protected void |
IltShortLinkLayout.layout(boolean redraw)
Computes the layout using the Short Link Layout algorithm.
|
protected void |
IltLocalLinkLayout.layout(boolean redraw) |
protected void |
IltLinkLayout.layout(boolean redraw)
Computes the layout using the Link Layout algorithm.
|
protected void |
IltStraightLinkLayout.layoutOneLink(IlvGraphModel graphModel,
Object link,
IlvRect frombbox,
IlvRect tobbox,
int connectorStyle,
boolean redraw) |
| Modifier and Type | Class and Description |
|---|---|
class |
IlvInappropriateGraphException
This exception can occur when a layout algorithm cannot deal with a
particular graph.
|
class |
IlvInappropriateLinkException
This exception can occur when a layout algorithm cannot deal with a
particular link.
|
| Modifier and Type | Method and Description |
|---|---|
IlvGraphLayoutException |
IlvGraphLayoutException.getNext()
Returns the next exception in an exception chain.
|
| Modifier and Type | Method and Description |
|---|---|
void |
IlvGraphLayoutException.setNext(IlvGraphLayoutException next)
Sets the next exception in an exception chain.
|
| Modifier and Type | Method and Description |
|---|---|
protected abstract void |
IlvGraphLayout.layout(boolean redraw)
Executes the layout.
|
IlvGraphLayoutReport |
IlvGraphLayout.performLayout()
Starts the layout algorithm using the currently attached graph model
and the current settings for the layout parameters.
|
IlvGraphLayoutReport |
IlvGraphLayout.performLayout(boolean force,
boolean redraw)
Starts the layout algorithm using the currently attached graph model
and the current settings for the layout parameters.
|
int |
IlvGraphLayout.performLayout(boolean force,
boolean redraw,
boolean traverse)
Starts the layout algorithm using the currently attached graph model
and the current settings for the layout parameters.
|
static int |
IlvGraphLayout.PerformLayout(IlvGraphModel graphModel,
IlvLayoutProvider layoutProvider,
boolean force,
boolean redraw,
boolean traverse)
Applies layout instances recursively to the specified graph model.
|
int |
IlvGraphModel.performLayout(IlvLayoutProvider layoutProvider,
boolean force,
boolean redraw,
boolean traverse)
Applies layout instances recursively to this graph model.
|
int |
IlvGraphModel.performLayout(IlvLayoutProvider layoutProvider,
IlvGraphLayout recursiveLayout,
boolean force,
boolean redraw,
boolean traverse)
Applies layout instances recursively to this graph model.
|
protected int |
IlvGraphLayout.performSublayout(Object subgraph,
IlvGraphLayout layout,
boolean force,
boolean redraw)
Starts the input layout algorithm.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
IlvBasicLinkStyleLayout.internalLayout(boolean redraw)
Called from
IlvBasicLinkStyleLayout.layout(boolean) to place the nodes. |
protected void |
IlvBasicLinkStyleLayout.layout(boolean redraw)
Computes the layout using the Basic Link Style Layout algorithm.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
IlvBusLayout.layout(boolean redraw)
Computes the layout using the Bus Layout algorithm.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
IlvCircularLayout.customizeLayoutOfClusterGraph(IlvGraphLayout layout)
Customize the layout of the cluster graph before it is applied.
|
protected void |
IlvCircularLayout.internalLayout(boolean redraw)
Computes the layout using the Circular Layout algorithm.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
IlvGridLayout.layout(boolean redraw)
Computes the layout using the Grid Layout algorithm.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
IlvHierarchicalLayout.layout(boolean redraw)
Computes the layout using the Hierarchical Layout algorithm.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
IlvLinkLayout.layout(boolean redraw)
Computes the layout using the Link Layout algorithm.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
IlvLongLinkLayout.layout(boolean redraw)
Computes the layout using the Long Link Layout algorithm.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
IlvShortLinkLayout.layout(boolean redraw)
Computes the layout using the Short Link Layout algorithm.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
IlvMultipleLayout.layout(boolean redraw)
Computes the layout using the Multiple Layout algorithm.
|
protected IlvGraphLayoutReport |
IlvMultipleLayout.performFirstGraphLayout(boolean redraw)
Called in order to perform the first graph layout.
|
protected IlvGraphLayoutReport |
IlvMultipleLayout.performSecondGraphLayout(boolean redraw)
Called in order to perform the second graph layout.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
IlvRandomLayout.internalLayout(boolean redraw)
Computes the layout using the Random Layout algorithm.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
IlvRecursiveLayout.layout(boolean redraw)
Computes the layout using the Recursive Layout algorithm.
|
IlvGraphLayoutReport |
IlvRecursiveLayout.performLayout(boolean force,
boolean redraw)
Starts the layout algorithm.
|
int |
IlvRecursiveLayout.performLayout(boolean force,
boolean redraw,
boolean traverse)
Starts the layout algorithm.
|
IlvGraphLayoutReport |
IlvRecursiveLayout.performLayout(Object subgraph,
boolean force,
boolean redraw,
boolean traverse)
Starts the layout algorithm with a subgraph.
|
protected int |
IlvRecursiveMultipleLayout.performSublayout(Object subgraph,
IlvGraphLayout layout,
boolean force,
boolean redraw)
Starts the input layout algorithm.
|
protected int |
IlvRecursiveLayout.performSublayout(Object subgraph,
IlvGraphLayout layout,
boolean force,
boolean redraw)
Starts the input layout algorithm.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
IlvSpringEmbedderLayout.layout(boolean redraw)
Deprecated.
Computes the layout using the Spring Embedder algorithm.
|
| Modifier and Type | Method and Description |
|---|---|
Object |
IlvTopologicalMeshLayout.getStartingNode()
Returns the current choice for the starting node.
|
protected void |
IlvTopologicalMeshLayout.internalLayout(boolean redraw)
Computes the layout using the Topological Mesh Layout algorithm.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
IlvTreeLayout.layout(boolean redraw)
Computes the layout using the Tree Layout algorithm.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
IlvUniformLengthEdgesLayout.internalLayout(boolean redraw)
Computes the layout using the Uniform Length Edges Layout algorithm.
|
© Copyright Rogue Wave Software, Inc. 1997, 2018. All Rights Reserved.