|Start Page Number:||341|
|End Page Number:||354|
|Publication Date:||Nov 1986|
|Journal:||RAIRO Operations Research|
In this paper, we present an algorithm to approximate lengths of the edges of a classification tree, and two algorithms of drawing of the resulting valuated tree: Radial drawing, in which we define a circular order of the terminals nodes and the directions of the edges. Then we plot the root and distribute adjacent vertex at a distance equal to the length of the edge, and so on from any plotted vertex. Arborescent drawing, in which we plant the tree, to define on arborescence and we plot lower adjacent vertex at a vertical distance equal to the length of the edge. The drawing algorithms have a linear complexity, when an appropriate coding for the tree is built.