基于遗传算法的二叉树画树算法  

Binary Tree Drawing Algorithm Based on Genetic Algorithms

作　　者：黄竞伟[1] 康立山[1] 陈毓屏[1] 

机构地区：[1]武汉大学软件工程国家重点实验室,武汉430072

出　　处：《软件学报》2000年第8期1112-1117,共6页Journal of Software

基　　金：国家自然科学基金! (No.6 96 35 0 30 );国家 86 3高科技项目基金! (No.86 3- 30 6 - ZT0 6 - 0 6 - 3)资助

摘　　要：用遗传算法设计了一种通用二叉树画树算法框架 .在该框架下 ,可以根据应用的不同 ,通过设计反映美观标准的不同目标函数来得到不同的画树算法 ,而且容易添加或减少美观标准以适应不同用户的需要 .与以前的算法相比 ,此算法具有算法统一、方法简单、容易实现和易于修改的优点 ,并且具有自适应、自学习和易于并行化的特点 .In this paper, a new general binary tree drawing algorithm frame is designed by using genetic algorithms. Under the frame, according to different applications, different binary drawing algorithms can be obtained by designing different objective functions reflecting aesthetic criteria. Furthermore, it is easy to add or reduce some of the aesthetic criteria in order to satisfy different users. Compared to previous algorithms, this algorithm is of the following advantages: the frames of the algorithms are unified, the method is simple, implementation and revision are easy. It has the following characters: self adaptive, self study and easily parellelized.

关 键 词：二叉树 画树算法 遗传算法 数据结构 

分 类 号：TP311.12[自动化与计算机技术—计算机软件与理论]