This is an algorithm that IMO every programmer should be familiar with. Its good that you are taking the time to learn.
#perl -e;
use Data::Dumper;
my %nodes;
my @children;
while (<DATA>) {
chomp;
my ($c,$p)=split/:/,$_;
push @children,$c unless $nodes{$c};
$nodes{$_}{name}||=$_
for $c,$p;
$nodes{$p}{kids}{$c}=$nodes{$c};
}
delete $nodes{$_}
for @children;
my @roots=keys %nodes;
print Dumper($nodes{$_}) for @roots;
__END__
b:a
c:a
d:b
e:c
f:c
This version of the algorithm is flexible, it doesnt expect the nodes to be inorder as some of the solutions posted do. It will also identify mixed heirarchies (ie two distinct trees in the same list), and is fairly simple. It has the disadvantage that it must store a list of the nodes which are children until the end of the data input. Here is the output:
$VAR1 = {
'name' => 'a',
'kids' => {
'c' => {
'name' => 'c',
'kids' => {
'e' => {
'name' => 'e'
},
'f' => {
'name' => 'f'
}
}
},
'b' => {
'name' => 'b',
'kids' => {
'd' => {
'name' => 'd'
}
}
}
}
};
---
$world=~s/war/peace/g
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.