#!/usr/bin/perl -w
use strict;
use Tree::DAG_Node;

my $root = Tree::DAG_Node->new;
$root->name('root');
$root->new_daughter->name($_) for ('1'..'3');
my @names = qw(abc def ghi);
my $count =0;
for my $n ($root->daughters) {
    for (split //, $names[$count++]) {
        $n->new_daughter->name($_)
    }
}
print map "$_\n", @{$root->draw_ascii_tree};