Order of layouts in recursive layouts

Assume graph 1 contains two subgraphs L1.1 and L1.2, and subgraph 1.1 contains two subgraphs L1.1.1 and L1.1.2, as shown in the following figure. The recursive layout needs to be applied in reverse order, as follows:
  1. Layout on L1.1.1
  2. Layout on L1.1.2
  3. Layout on L1.1
  4. Layout on L1.2
  5. Layout on L1
Nested
graph with recursive layouts shown from upper to lower part of the
figure on the left: L1, L1.1, L1.1.1, L1.1.2. Subgraph layout L1.2
is shown on the right.
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 subgraph L1.1 are finished before the layout of graph L1 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.