Difference between revisions of "Grid layout"
From BioUML platform
Tagir Valeev (Talk | contribs) m (+stub message) |
|||
| (One intermediate revision by one user not shown) | |||
| Line 1: | Line 1: | ||
{{Layout algorithm|ru.biosoft.graph.FastGridLayouter}} | {{Layout algorithm|ru.biosoft.graph.FastGridLayouter}} | ||
| − | {{stub}} | + | {{stub|algorithm details and references}} |
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. | 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. | ||
| Line 10: | Line 10: | ||
==See also== | ==See also== | ||
| − | * [[ | + | * [[Diagram document]] |
Latest revision as of 13:38, 2 July 2013
- 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.
