Binary Tree Drawing Algorithm Based on Genetic Algorithms
基于遗传算法的二叉树画树算法

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.