Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris

Re: Tree Structure Challenge

by LanX (Sage)
on Nov 30, 2015 at 22:26 UTC ( #1148972=note: print w/replies, xml ) Need Help??

in reply to Tree Structure Challenge

Here the naive approach, no time to do the performant part now

I didn't implement a class or objects, just array for leaves and a hash %parent for the parent relation.

use strict; use warnings; use Data::Dump qw/pp/; my $tree = { Mammal => { Bovine => ["Cow", "Bison"], Canine => ["Dog", "Fox", "Wolf"], Equine => ["Horse", "Zebra", "Pony"], }, Reptile => { Bird => ["Pigeon", "Canary", "Owl"], Lizard => ["Salamander", "Chameleon"], Snake => ["Python", "Cobra"], }, }; my %parent; init_parent($tree,""); #pp \%parent; naive([qw/Cobra/],[qw/Fox/]); naive([qw/Dog Fox Wolf/],[qw/Fox/]); sub naive { my ($a,$b) =@_; my $h_a = pedigree(@$a); my $h_b = pedigree(@$b); my %add= %$h_b; delete @add{keys %$h_a}; my %delete= %$h_a; delete @delete{keys %$h_b}; pp [ [keys %add], [keys %delete]]; } sub pedigree { my @children = @_; my %nodes; @nodes{@children}=(); while (my @parents = @parent{@children} ) { #pp \@parents; @nodes{@parents}=@children; last if exists $nodes{""}; @children=@parents; } \%nodes; } sub init_parent { my ($tree,$parent) = @_; if (ref $tree eq "HASH") { while (my($key,$subtree) =each %$tree) { $parent{$key}=$parent; init_parent($subtree, $key); } } elsif (ref $tree eq "ARRAY") { for my $leave (@$tree) { $parent{$leave} = $parent; } } else { die "Corrupt Tree $tree"; } }

Cheers Rolf
(addicted to the Perl Programming Language and ☆☆☆☆ :)
Je suis Charlie!

Replies are listed 'Best First'.
Re^2: Tree Structure Challenge
by choroba (Archbishop) on Nov 30, 2015 at 23:13 UTC
    Yes, this seems to pass all my tests (after I made into the proper class). Congratz!

    And you used the same algorithm as I did (with almost the same variable names).

    And it's not Sunday yet!

    ($q=q:Sq=~/;[c](.)(.)/;chr(-||-|5+lengthSq)`"S|oS2"`map{chr |+ord }map{substrSq`S_+|`|}3E|-|`7**2-3:)=~y+S|`+$1,++print+eval$q,q,a,
      Great so if I don't need to produce an efficient version anymore, I can enjoy Sunday! =)

      Cheers Rolf
      (addicted to the Perl Programming Language and ☆☆☆☆ :)
      Je suis Charlie!

Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://1148972]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (2)
As of 2022-08-19 05:39 GMT
Find Nodes?
    Voting Booth?

    No recent polls found