Describes how to perform a layout on nested graphs.
In this section
- Order of layouts in recursive layouts
-
Explains the order in which recursive layouts are applied on nested graphs.
-
- Simple recursion: applying the same layout to all subgraphs
-
Describes how to obtain a nested graph with the same layout throughout.
-
- Advanced recursion: mixing different layouts in a nested
graph
-
Describes the case where you want to mix different layouts in one nested graph.
-
Current section