This paper describes a new automatic layout algorithm named CoSEP for compound graphs with port constraints. The algorithm works by extending the physical model of a previous algorithm named CoSE by defining additional force types and heuristics for constraining edges to connect to certain user-defined locations on end nodes. Similar to its predecessor, CoSEP also accounts for non-uniform node dimensions and arbitrary levels of nesting via compound nodes. Our experiments show that CoSEP significantly improves the quality of the layouts for compound graphs with port constraints with respect to commonly accepted graph drawing criteria while running reasonably fast, suitable for use in interactive applications for small to medium-sized (up to 500 nodes) graphs. A complete JavaScript implementation of CoSEP as a Cytoscape.js extension along with a demo page is freely available at https://github.com/iVis-at-Bilkent/cytoscape.js-cosep.

本文描述了一种新的自动布局算法 CoSEP，用于具有端口约束的复合图。该算法的工作原理是通过定义附加的力类型和启发式方法来扩展名为 CoSE 的先前算法的物理模型，以约束边缘以连接到端节点上的某些用户定义的位置。与其前身类似，CoSEP 还通过复合节点解释了不均匀的节点尺寸和任意级别的嵌套。我们的实验表明，相对于普遍接受的图形绘制标准，CoSEP 显着提高了具有端口约束的复合图形的布局质量，同时运行速度相当快，适用于中小型（最多 500 个节点）图形的交互式应用程序. CoSEP 作为 Cytoscape 的完整 JavaScript 实现。