Standard names for "stacked" versus "hanging" layered graph drawing algorithms? -
here 2 different ways of drawing same hierarchy. notice in "stacked" layout, nodes 1 layer higher highest "child" node. (important: see edit @ bottom of question example)
do these 2 types of layered drawing methods have specific names? i'm trying find existing algorithms "stacked" one, can't seem surface info because don't know it's called.
if don't have names distinguish them because rely on same algorithm, there known sets of parameters attaining "stacked" version of graph existing algorithms? thanks!
edit: although above graphs strict "trees", algorithm i'm looking should able handle cases nodes have more 1 parent, , cases there more 1 path root leaf. here's example, , here's another.
edit2: in case it's useful anyone, hacky (and slow) force-directed approach pre-computed node layers (y-axis contraints) seems work right. here's looks like. example uses cytoscape.js , cola.js, , it's upside down. it's not @ solution question i'm putting here edit.
(so wouldn't let me submit jsbin link without code block...)
i don't know of specific names above. looks layering algorithm in both cases longest path algorithm minimizes height ignores width. if layer graph bottom-up , graph has many sinks (vertices 0 out-degree) wide bottom layer (a "stacked" layout?). if layer graph top-down , has many sources (vertices 0 in-degree) wide top layer (a "hanging" layout?).
Comments
Post a Comment