1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
|
use strict; use warnings;
use Test::More tests => 29;
use Graph;
use Graph::BitMatrix;
my $g = Graph->new;
$g->add_edge(qw(e a));
$g->add_edge(qw(a b));
$g->add_edge(qw(b c));
$g->add_edge(qw(b d));
$g->add_edge(qw(d d));
$g->delete_vertex('e');
my $m = Graph::BitMatrix->new($g);
ok(!$m->get(qw(a a)) );
ok( $m->get(qw(a b)) );
ok(!$m->get(qw(a c)) );
ok(!$m->get(qw(a d)) );
ok(!$m->get(qw(b a)) );
ok(!$m->get(qw(b b)) );
ok( $m->get(qw(b c)) );
ok( $m->get(qw(b d)) );
ok(!$m->get(qw(c a)) );
ok(!$m->get(qw(c b)) );
ok(!$m->get(qw(c c)) );
ok(!$m->get(qw(c d)) );
ok(!$m->get(qw(d a)) );
ok(!$m->get(qw(d b)) );
ok(!$m->get(qw(d c)) );
ok( $m->get(qw(d d)) );
$m->set(qw(c c));
ok( $m->get(qw(c c)) );
$m->unset(qw(c c));
ok(!$m->get(qw(c c)) );
is("@{[$m->get_row(qw(a a b c d))]}", "0 1 0 0");
is("@{[$m->get_row(qw(b a b c d))]}", "0 0 1 1");
is("@{[$m->get_row(qw(c a b c d))]}", "0 0 0 0");
is("@{[$m->get_row(qw(d a b c d))]}", "0 0 0 1");
is $m->stringify, <<'EOF';
to: a b c d
a 0 1 0 0
b 0 0 1 1
c 0 0 0 0
d 0 0 0 1
EOF
is scalar Graph::BitMatrix->new($g, transpose => 1)->stringify, <<'EOF';
to: a b c d
a 0 0 0 0
b 1 0 0 0
c 0 1 0 0
d 0 1 0 1
EOF
is( $m->get(qw(x x)), undef );
is("@{[sort $m->vertices]}", "a b c d");
$m->set_row(qw(b a c));
is("@{[$m->get_row(qw(b a b c d))]}", "1 0 1 1");
$m->unset_row(qw(b c d));
is("@{[$m->get_row(qw(b a b c d))]}", "1 0 0 0");
eval { Graph::BitMatrix->new($g, nonesuch => 1) };
like($@, qr/Graph::BitMatrix::new: Unknown option: 'nonesuch' /);
|
