Concepts for nested layouts

In IBM® ILOG® Dojo Diagrammer, graphs can display subgraphs as nodes.
Nested layouts use recursive layout.
The following figure shows an example of a nested graph.
Example
of a nested graph that shows two subgraphs with nodes belonging to
the top-level graph. These subgraphs contain sets of nodes that belong
to other subgraphs. The node on the left contains two sets of three
nodes that form two different subgraphs, each of which contains three
nodes. There is an intergraph link between the top-level nodes of
these subgraphs. Another intergraph link connects the top-level node
of the right subgraph to the first subgraph on the right of the figure.
The node on the right contains a first subgraph with three nodes.
The first node links to another subgraph that contains the other two
nodes.
Example of a nested graph
A graph that is a node in another graph is called a subgraph. Links that connect nodes of different subgraphs are called subgraph links. The red links in the figure are intergraph links.