Structure of the graph layout API

The graph layout API is composed of:

The generic graph layout package

IBM® ILOG® Dojo Diagrammer provides a high-level, generic framework for the graph layout services: ibm_ilog.graphlayout.

The layout algorithm packages

  • ibm_ilog.graphlayout.forcedirected: A layout algorithm that can be used to lay out any type of graph and allows you to specify the length of the links.
  • ibm_ilog.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.
  • ibm_ilog.graphlayout.hierarchical: A layout algorithm that arranges nodes in horizontal or vertical levels such that the links flow in a uniform direction.
  • ibm_ilog.graphlayout.longlink: A layout algorithm that reshapes the long orthogonal links of a graph without moving the nodes.
  • ibm_ilog.graphlayout.shortlink: A layout algorithm that reshapes the short links of a graph without moving the nodes.
  • ibm_ilog.graphlayout.random: A layout algorithm that moves the nodes of the graph at randomly computed positions inside a user-defined region.
  • ibm_ilog.graphlayout.circular: A layout algorithm that displays graphs representing interconnected ring and/or star network topologies.
  • ibm_ilog.graphlayout.grid: A layout algorithm that arranges the disconnected nodes of a graph in rows, in columns, or in the cells of a grid.