File Coverage

blib/lib/Graph/AdjacencyMatrix.pm

Criterion	Covered	Total	%
statement	55	55	100.0
branch	17	18	94.4
condition			n/a
subroutine	13	13	100.0
pod	6	6	100.0
total	91	92	98.9

package Graph::AdjacencyMatrix;

use strict;
use warnings;

use Graph::BitMatrix;
use Graph::Matrix;

use base 'Graph::BitMatrix';

use Graph::AdjacencyMap qw(:flags :fields);

sub _AM () { 0 }
sub _DM () { 1 }
sub _V () { 2 } # Graph::_V
sub _E () { 3 } # Graph::_E

sub new {
    my ($class, $g, %opt) = @_;
    my @V = $g->vertices;
    my $want_distance = delete $opt{distance_matrix};
    my $d = Graph::_defattr();
    if (exists $opt{attribute_name}) {
	$d = delete $opt{attribute_name};
	$want_distance++;
    }
    my $want_transitive = delete $opt{is_transitive};
    Graph::_opt_unknown(\%opt);
    my $m = Graph::BitMatrix->new($g);
    my $self = bless [ $m, undef, \@V ], $class;
    return $self if !$want_distance;
    my $n = $self->[ _DM ] = Graph::Matrix->new($g);
    $n->set($_, $_, 0) for @V;
    my $n0 = $n->[0];
    my $n1 = $n->[1];
    my $undirected = $g->is_undirected;
    my $multiedged = $g->multiedged;
    for my $e ($g->edges) {
	my ($u, $v) = @$e;
        $n->set($u, $v, $multiedged
	    ? _multiedged_distances($g, $u, $v, $d)
	    : $g->get_edge_attribute($u, $v, $d)
        );
        $n->set($v, $u, $multiedged
	    ? _multiedged_distances($g, $v, $u, $d)
	    : $g->get_edge_attribute($v, $u, $d)
        ) if $undirected;
    }
    $self;
}

sub _multiedged_distances {
    my ($g, $u, $v, $attr) = @_;
    my %r;
    for my $id ($g->get_multiedge_ids($u, $v)) {
	my $w = $g->get_edge_attribute_by_id($u, $v, $id, $attr);
	$r{$id} = $w if defined $w;
    }
    keys %r ? \%r : undef;
}

sub adjacency_matrix { $_[0]->[ _AM ] }

sub distance_matrix { $_[0]->[ _DM ] }

sub vertices { @{ $_[0]->[ _V ] } }

sub is_adjacent {
    my ($m, $u, $v) = @_;
    $m->[ _AM ]->get($u, $v) ? 1 : 0;
}

sub distance {
    my ($m, $u, $v) = @_;
    defined $m->[ _DM ] ? $m->[ _DM ]->get($u, $v) : undef;
}

1;
__END__