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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
use Graph::Directed;
use strict;
local $^W = 1;
print "1..30\n";
my $g = Graph::Directed->new(compat02 => 1);
$g->add_edge('a', 'b');
$g->add_edge('b', 'c');
$g->add_edge('a', 'd');
$g->add_vertex('e');
print "not " unless $g->in_degree('a') == 0;
print "ok 1\n";
print "not " unless $g->out_degree('a') == 2;
print "ok 2\n";
print "not " unless $g->degree('a') == -2;
print "ok 3\n";
print "not " unless $g->in_degree('b') == 1;
print "ok 4\n";
print "not " unless $g->out_degree('b') == 1;
print "ok 5\n";
print "not " unless $g->degree('b') == 0;
print "ok 6\n";
print "not " unless $g->in_degree('c') == 1;
print "ok 7\n";
print "not " unless $g->out_degree('c') == 0;
print "ok 8\n";
print "not " unless $g->degree('c') == 1;
print "ok 9\n";
print "not " unless $g->in_degree('d') == 1;
print "ok 10\n";
print "not " unless $g->out_degree('d') == 0;
print "ok 11\n";
print "not " unless $g->degree('d') == 1;
print "ok 12\n";
print "not " unless $g->in_degree('e') == 0;
print "ok 13\n";
print "not " unless $g->out_degree('e') == 0;
print "ok 14\n";
print "not " unless $g->degree('e') == 0;
print "ok 15\n";
print "not " if defined $g->in_degree('x');
print "ok 16\n";
print "not " if defined $g->out_degree('x');
print "ok 17\n";
print "not " if defined $g->degree('x');
print "ok 18\n";
print "not " unless join(" ", $g->in_edges('b')) eq "a b";
print "ok 19\n";
print "not " unless join(" ", $g->out_edges('b')) eq "b c";
print "ok 20\n";
print "not " unless join(" ", $g->edges('b')) eq "a b b c" ||
join(" ", $g->edges('b')) eq "b c a b";
print "ok 21\n";
print "not " if defined $g->in_edges('x');
print "ok 22\n";
print "not " if defined $g->out_edges('x');
print "ok 23\n";
print "not " unless $g->edges == 3;
print "ok 24\n";
print "not " unless join(" ", sort $g->sink_vertices) eq "c d";
print "ok 25\n";
print "not " unless join(" ", sort $g->source_vertices) eq "a";
print "ok 26\n";
print "not " unless join(" ", sort $g->exterior_vertices) eq "a c d e";
print "ok 27\n";
print "not " unless join(" ", sort $g->interior_vertices) eq "b";
print "ok 28\n";
$g->add_cycle('f');
print "not " unless join(" ", sort $g->self_loop_vertices) eq "f";
print "ok 29\n";
print "not " unless join(" ", sort $g->interior_vertices) eq "b";
print "ok 30\n";
|
