***** To join INSNA, visit http://www.insna.org ***** Thanks Moses
What exactly do you mean by "length of the edges"? Is this the same
with the level of nodes in a rooted tree, the maximum of which being
what is called the height of the tree?
If yes, then in the case of a binary tree T with n nodes, you may want
to consider that the height of a tree ht(T) is bounded by
ceiling(lg(n + 1) - 1) \leq ht(T) \leq (n - 1)/2,
where lg is the logarithm with base 2.
Furthermore, among all regular binary trees with n nodes, the minimum
average level for the leaves is attained by the complete regular
Now, a good source of algorithms on search trees is Robert Tarjan's
Data Structures and Network Algorithms (chapter 4 etc.).
I understand that these hints might not be what you're looking for (in
case you may wish to remain on visualization techniques). Perhaps
others in the list might be able to help you more on this.
2012/3/2 Kimmo Soramäki <[log in to unmask]>:
> ***** To join INSNA, visit http://www.insna.org ***** Hello everyone
> _____________________________________________________________________ SOCNET>
> Does anyone know of an algorithm (any language) for drawing a tree graph
> with the constraint that the length of the edges is pre-specified? If the
> algorithm is in Java and specifies vertex coordinates - even better.
> Most algorithms I see adjust the length of the edges for visual purposes.
> Thanks a lot!
> Kimmo Soramaki
> Founder, www.fna.fi
> Blog, www.fna.fi/blog
> [log in to unmask]
> is a service of INSNA, the professional association for social network
> researchers (http://www.insna.org). To unsubscribe, send an email message to
> [log in to unmask] containing the line UNSUBSCRIBE SOCNET in the body of
> the message.