摘要
最小化边交叉数是层次图绘制过程中的一个关键步骤,直接影响着层次图的可读性。提出了一个基于 遗传算法的层次图边交叉数最小化算法,详细地给出了编码表示方法以及遗传算子的设计。与常用的启发算法 相比,该算法得到了更好的计算结果,此外算法简单且易于实现。
Minimizing edge crossing is a key problem in drawing layered digraphs, and it's directly involved with the readability of the graph. An edge crossing minimization algorithm for layered digraphs based on genetic algorithms is present in this article, the code method and the genetic operator are given detailedly. The algorithm is more efficient while comparing it with some heuristic algorithms, and it's simple and easy to implement.
出处
《计算机工程与设计》
CSCD
2003年第5期91-93,96,共4页
Computer Engineering and Design
基金
国家自然科学基金资助项目(60173045)
