Grid layout

Diagram "Aguda1999_CellCycle" layouted using the grid layout algorithm.

Title

Grid layout

Class

FastGridLayouter

This page or section is a stub. Please add algorithm details and references here!

This algorithm has much in common with the cross cost grid layout algorithm, the main difference being in evaluating weight matrix. The fast grid layout algorithm applies for this purpose a method termed sweep calculation, which reduces time complexity and makes this algorithm faster than the cross cost grid layout algorithm.

The algorithm uses parameters similar to those of the cross cost grid layout. Some unique features are available:

• Treads count - a positive integer parameter for parallel version of algorithm,
• Keep current layout - if checked then the algorithm starts with the current layout, else starts with a random layout,
• Path layouter - the parameter determines the edge drawing style.

See also

• Diagram document