Combining hierarchy and energy for drawing directed graphs
Combining hierarchy and energy for drawing directed graphs
复制标题
DOI：
10.1109/tvcg.2004.1260757
复制
发表时间：
2004-01-01
影响因子：
5.2
通讯作者：
Koren, Y
中科院分区：
文献类型：
--
作者：
Carmel, L;Harel, D;Koren, Y
我们提出了一种绘制有向图的算法，该算法基于快速求解每个轴的唯一一维优化问题。该算法对图的层次结构进行了清晰的描述。节点不限于位于固定的水平层上，从而产生非常自然地传达图形对称性的布局。该算法可以在不改变有向图或无圈有向图的情况下，甚至可以应用于同时包含有向边和无向边的图。我们还从输入有向图中导出了一个层次指数，它定量地度量了它的层次数量。
We present an algorithm for drawing directed graphs which is based on rapidly solving a unique one-dimensional optimization problem for each of the axes. The algorithm results in a clear description of the hierarchy structure of the graph. Nodes are not restricted to lie on fixed horizontal layers, resulting in layouts that convey the symmetries of the graph very naturally. The algorithm can be applied without change to cyclic or acyclic digraphs and even to graphs containing both directed and undirected edges. We also derive a hierarchy index from the input digraph, which quantitatively measures its amount of hierarchy.