Difference between revisions of "Hierarchical layout"
From BioUML platform
Tagir Valeev (Talk | contribs) |
Tagir Valeev (Talk | contribs) m (+stub message) |
||
| (4 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
| − | {{stub}} | + | {{Layout algorithm|ru.biosoft.graph.HierarchicLayouter}} |
| + | {{stub|algorithm details and references}} | ||
| − | + | The hierarchical layout algorithm tries to arrange the compounds in a fashion that the irreversible reactions point in one direction. This type of visuallization is especially useful for metabolic pathways, in which the reactions occur only in one direction. The algorithm partitions the compounds into layers and than arranges the compounds in the layers, such that the number of crossings between different reactions is low. The hierarchic layout algorithm usually produces few crossings and no overlaps. However, if the data is not directed, the resulting layout may be not satisfactory and a [[Force directed layout|force-directed layout]] may be more appropiate. | |
| − | + | ==See also== | |
| − | + | * [[Diagram document]] | |
| − | [[ | + | |
Latest revision as of 13:39, 2 July 2013
- Title
- Hierarchical layout
- Class
HierarchicLayouter
| This page or section is a stub. Please add algorithm details and references here! |
The hierarchical layout algorithm tries to arrange the compounds in a fashion that the irreversible reactions point in one direction. This type of visuallization is especially useful for metabolic pathways, in which the reactions occur only in one direction. The algorithm partitions the compounds into layers and than arranges the compounds in the layers, such that the number of crossings between different reactions is low. The hierarchic layout algorithm usually produces few crossings and no overlaps. However, if the data is not directed, the resulting layout may be not satisfactory and a force-directed layout may be more appropiate.
