|
|||||
|
|
| 一种基于继承次序与相关度的布图算法 | |
| 引用本文： | 张毅坤,朱伟,王凯,胡燕京.一种基于继承次序与相关度的布图算法[J].计算机应用,2009,29(5):1373-1375. |
| 作者姓名： | 张毅坤 朱伟 王凯 胡燕京 |
| 作者单位： | 1. 西安理工大学,计算机科学与工程学院,西安,710048 2. 西安市计量技术研究院,西安,710068 3. 武警工程学院,西安,710086 |
| 摘 要： | 在层次图边交叉最小化问题上,常规启发算法或者时间复杂度大或者布图效果不佳。基于Sugiyama布图算法模式，提出了一种交叉数减少算法，并从布局与布线两个主要方面介绍了其实现过程。两层图上的实验表明，该算法具有较好的性能，一定程度上克服了时间复杂度与效果的矛盾。 |
| 关 键 词： | 软件可视化 层次图 布图算法 交叉最小化 software visualization hierarchical graph layout algorithm crossing minimization |
| 收稿时间： | 2008-11-19 |
| 修稿时间： | 2009-01-14 |
Hierarchical layout algorithm based on order of succession and degree of association |
|
| ZHANG Yi-kun,ZHU Wei,WANG Kai,HU Yanj-ing.Hierarchical layout algorithm based on order of succession and degree of association[J].journal of Computer Applications,2009,29(5):1373-1375. | |
| Authors: | ZHANG Yi-kun ZHU Wei WANG Kai HU Yanj-ing |
| Affiliation: | 1.School of Computer Science and Engineering;Xi'an University of Technology;Xi'an Shaanxi 710048;China;2.Xi'an Institute of Measuring Technology;Xi'an Shaanxi 710068;3.Engineering College of Armed Police Force;Xi'an Shaanxi 710086;China |
| Abstract: | On the issue of crossing minimization, either time complexity or result of the conventional heuristic algorithm is unsatisfactory. The authors proposed a kind of cross-reduction algorithm based on Sugiyama algorithm, and introduced the implementation mainly in layout and routing. Experimental results of two-layer hierarchical graph show that the algorithm has better performance, to a certain extent, and overcomes the contradiction between time complexity and effect. |
| Keywords: | software visualization hierarchical graph layout algorithm crossing minimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
| 点击此处可从《计算机应用》浏览原始摘要信息 | |
| 点击此处可从《计算机应用》下载全文 | |