directed acyclic graphs - Is there a 2D-layout algorithm for DAGs that allows the positions on one axis to be fixed? -
i've got dag of around 3.300 vertices can laid out quite dot
more or less simple tree (things complicated because vertices can have more 1 predecessor whole different rank, crossovers frequent). each vertex in graph came being @ specific time in original process , want 1 axis in layout represent time: edge relation a -> v, b -> v
means a
, b
came being @ specific time before v
.
is there layout algorithm dags allow me specify positions (or @ least distances) on 1 axis , come optimal layout regarding edge crossovers on other?
you can make topological sorting of dag have vertices sorted in way every edge x->y
, vertex x
comes before y
.
therefore, if have a -> v, b -> v
, a, b, v
or b, a, v
.
using can represents dag
s this:
Comments
Post a Comment