1 /| 2 | \| 3
Furthermore asking for the "shortest" path in a tree doesn't make much sense, there is by definition exactly one between any two nodes.
Cheers Rolf
(addicted to the Perl Programming Language and ☆☆☆☆ :)
¹) the definition above circumvents the problem by postulating an undirected graph.
In reply to Re^5: Tree in perl
by LanX
in thread Tree in perl
by saurabh2k26
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |