Chapter 3. General Purpose Layout

Table of Contents

3.1. How does it work ?
3.2. What are the different options for ?
3.3. Redraw and Modifications to the Graph
3.4. What performances to expect ?

3.1. How does it work ?

The "General Purpose Layout" combines a tree algorithm and an energy algorithm backed by several optimization methods (mainly a modified-Newton method and Simulated Annealing algorithm).The structure of the graph is probed, and the graph is divided in linked components of two types : sub-trees and loops. Each component is drawn independently -- sub-trees using the tree algorithm, loops using the energy algorithm. The components are then combined together in a tree-like fashion.