1. All graphs are boxed. Boxed graphs are drawn in independent frames. Edges between nodes in different frames are substituted by edges between frames.

Note: Different layout algorithms or layout parameters can be chosen within boxes. For example, graph B is drawn in a force-directed layout, graph C in a tree layout with a top down orientation and graph E right-left-oriented.

2. The frames of graphs B, C, and E are now folded. Nodes inside these frames, i.e. the nodes of the corresponding subgraphs, disappear.

3. The frames of graphs A and D are unfolded and the formerly substituted edges are shown.

4. The summary nodes of graphs B, C, and E are unfolded. No frames and summary nodes any longer exist in this rendering. Substituted edges are introduced that start/end at the root node of a frame/subgraph.

5. Graphs A and D are boxed again, but graphs B, C, and E remain unfolded.

6. Graphs B, C, and E are wrapped. This operation doesn't change the layout.

7. All graphs are clustered. This is an experimental feature. In this case it is not possible to choose a different layout for subgraphs. However, many aiSee users find clustering quite useful.

My favorite layout algorithm is

» View results