首页 | 本学科首页   官方微博 | 高级检索  
     

基于遗传算法的二叉树画树算法
引用本文:黄竞伟,康立山,陈毓屏. 基于遗传算法的二叉树画树算法[J]. 软件学报, 2000, 11(8): 1112-1117
作者姓名:黄竞伟  康立山  陈毓屏
作者单位:武汉大学软件工程国家重点实验室,武汉,430072
基金项目:本文研究得到国家自然科学基金(No.69635030)和国家863高科技项目基金(No.863- 306-ZT06-06-3)资助.
摘    要:用遗传算法设计了一种通用二叉树画树算法框架.在该框架下,可以根据应用的不同,通过设 计反映美观标准的不同目标函数来得到不同的画树算法,而且容易添加或减少美观标准以适 应不同用户的需要.与以前的算法相比,此算法具有算法统一、方法简单、容易实现和易于修 改的优点,并且具有自适应、自学习和易于并行化的特点.

关 键 词:二叉树  画树算法  遗传算法.
收稿时间:1999-04-08
修稿时间:1999-08-10

Binary Tree Drawing Algorithm Based on Genetic Algorithms
HUANG Jing-wei,KANG Li-shan and CHEN Yu-ping. Binary Tree Drawing Algorithm Based on Genetic Algorithms[J]. Journal of Software, 2000, 11(8): 1112-1117
Authors:HUANG Jing-wei  KANG Li-shan  CHEN Yu-ping
Affiliation:State Key Laboratory of Software Engineering Wuhan University Wuhan 430072
Abstract:In this paper, a new general binary tree drawing algorithm frame is de signed by using genetic algorithms. Under the frame, according to different appl ications, different binary drawing algorithms can be obtained by designing diffe rent objective functions reflecting aesthetic criteria. Furthermore, it is easy to add or reduce some of the aesthetic criteria in order to satisfy different us ers. Compared to previous algorithms, this algorithm is of the following advanta ges: the frames of the algorithms are unified, the method is simple, implementat ion and revision are easy. It has the following characters: self-adaptive, self -study and easily parellelized.
Keywords:Binary tree   tree drawing algorithm   genetic algorithm.
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号