Assume grapher
1
contains two subgraphers L
1.1
and
L1.2,
and subgrapher
1.1
contains two subgraphers L
1.1.1
and L
1.1.2
, as shown in the following figure. The recursive layout needs to
be applied in reverse order, as follows:
- Layout on L
1.1.1 - Layout on
L1.1.2 - Layout on
L1.1 - Layout on
L1.2 - Layout on
L1
Nested graph with recursive layouts
This means that the layout is applied to the
graph after all the layouts of its subgraphs have been applied.
In this example, all layouts of subgrapher L
1.1
are finished before the layout of grapher L
1
starts. It is the correct order for a recursive layout. This
order ensures that the layout of a subgraph does not invalidate
the layout of its parent graphs.