ilog.views.graphlayout.bus: A layout algorithm designed to display bus network topologies (that is, a set of nodes connected to a bus node).

ilog.views.graphlayout.circular: A layout algorithm that displays graphs representing interconnected ring and/or star network topologies.

ilog.views.graphlayout.grid: A layout algorithm that arranges the disconnected nodes of a graph in rows, in columns, or in the cells of a grid.

ilog.views.graphlayout.hierarchical: A layout algorithm that arranges nodes in horizontal or vertical levels such that the links flow in a uniform direction.

ilog.views.graphlayout.link: A layout algorithm that reshapes the links of a graph without moving the nodes.

ilog.views.graphlayout.multiple: A facility that combines multiple layout algorithms and treat them as one algorithm object.

ilog.views.graphlayout.random: A layout algorithm that moves the nodes of the graph at randomly computed positions inside an user-defined region.

ilog.views.graphlayout.recursive: A layout algorithm that can be used to control the layout of nested graphs (containing subgraphs and intergraph links).

ilog.views.graphlayout.topologicalmesh: A layout algorithm that can be used to lay out cyclic graphs.

ilog.views.graphlayout.tree: A layout algorithm that arranges the nodes of a tree horizontally or vertically, starting from the root of the tree. A radial layout mode allows you to arrange the nodes of a tree on concentric circles around the root of the tree.

ilog.views.graphlayout.uniformlengthedges: A layout algorithm that can be used to lay out any type of graph and allows you to specify the length of the links.

ilog.views.graphlayout.labellayout.annealing: For close label positioning.

ilog.views.graphlayout.labellayout.random: For random placement.