File Coverage

blib/lib/Tree/Visualize/GraphViz/Layouts/Binary/SearchTree.pm

Criterion	Covered	Total	%
statement	12	29	41.3
branch	0	8	0.0
condition	0	6	0.0
subroutine	4	6	66.6
pod	1	1	100.0
total	17	50	34.0

package Tree::Visualize::GraphViz::Layouts::Binary::SearchTree;

use strict;
use warnings;

use Tree::Visualize::Exceptions;

our $VERSION = '0.01';

use base qw(Tree::Visualize::Layout::ILayout);

sub draw {
    my ($self, $binary_tree) = @_;
    (defined($binary_tree) && ref($binary_tree) && UNIVERSAL::isa($binary_tree, "Tree::Binary::Search"))
            || throw Tree::Visualize::IncorrectObjectType "argument must be Tree::Binary::Search instance";
    # if its a binary search tree,
    # we need to extract the binary
    # tree in it
    $binary_tree = $binary_tree->getTree() if $binary_tree->isa("Tree::Binary::Search");
    # call our private method here
    $self->_draw($binary_tree);
}

sub _draw {
    my ($self, $tree) = @_;
    my $tree_id = $tree->getUID();
    my $output = "digraph test {\n";
    $output .= "node_$tree_id [ label = \" | " . $tree->getNodeValue() . "| \" ];\n";

    if ($tree->hasLeft()) {
        $output .= $self->_draw($tree->getLeft());
        my $left_id = $tree->getLeft()->getUID();
        $output .= "node_${tree_id}:f0 -> node_${left_id}:f1;\n";
    }
    if ($tree->hasRight()) {
        $output .= $self->_draw($tree->getRight());
        my $right_id = $tree->getRight()->getUID();
        $output .= "node_${tree_id}:f2 -> node_${right_id}:f1;\n";
    }

    return $output  . "}\n";
}

1;

__END__