You really don't need Tree::Simple to do that. A simple approach could be:
- Read the file in a hash in the form child => parent
- Get all the leaves: keys of the hash that are not used also as values (keys, grep)
- For each leaf
- Generate an array with its "genealogy" searchin in the hash till you get a value that's not a key (a root)
- reverse the array
- join
- print
All considered it should be no more than 20 lines of code.
Update: make it 22...
#!/usr/bin/perl
use strict;
use warnings;
open my $f,"<","x.txt";
my %tree;
while (<$f>) {
chomp;
my ($c,$p)=split(/:/,$_);
$tree{$c}=$p;
}
my %eert = reverse %tree;
foreach my $l (keys %tree) {
if (!defined($eert{$l})) {
my @g=($l);
while($l) {
$l=$tree{$l};
push(@g,$l) if defined($l);
}
print join(':',@g),"\n";
}
}
Rule One: "Do not act incautiously when confronting a little bald wrinkly smiling man."
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.