Difference between revisions of "Hierarchical layout"
From BioUML platform
Tagir Valeev (Talk | contribs) |
Tagir Valeev (Talk | contribs) m (hierarchic -> hierarchical) |
||
| Line 1: | Line 1: | ||
{{stub}} | {{stub}} | ||
| − | [[File:Diagram hierarchical view.png|thumb|Diagram "Aguda1999_CellCycle" layouted using the | + | [[File:Diagram hierarchical view.png|thumb|Diagram "Aguda1999_CellCycle" layouted using the hierarchical layout algorithm.]] |
| − | The | + | 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. |
[[Category:Layout algorithms]] | [[Category:Layout algorithms]] | ||
Revision as of 15:46, 14 June 2013
| This page or section is a stub. Please add more information here! |
File:Diagram hierarchical view.png
Diagram "Aguda1999_CellCycle" layouted using the hierarchical layout algorithm.
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.
