File: 66_simple.t

package info (click to toggle)
libgraph-perl 1%3A0.96-2
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 1,316 kB
  • ctags: 938
  • sloc: perl: 6,094; sh: 8; makefile: 2
file content (168 lines) | stat: -rw-r--r-- 4,782 bytes parent folder | download | duplicates (6)
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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
use Test::More tests => 96;

use Graph;

my ($g0, $g1, $g2, $g3, $g4, $g5, $g6, $g7,
    $g8, $g9, $ga, $gb, $gc, $gd, $ge, $gf);

$g0 = Graph->new;
$g1 = Graph->new(countedged => 1);
$g2 = Graph->new->add_edge(qw(a a));
$g3 = Graph->new(countedged => 1)->add_edge(qw(a a));
$g4 = Graph->new->add_edge(qw(a b));
$g5 = Graph->new(countedged => 1)->add_edge(qw(a b));
$g6 = Graph->new->add_edge(qw(a a))->add_edge(qw(a b));
$g7 = Graph->new(countedged => 1)->add_edge(qw(a a))->add_edge(qw(a b));
$g8 = Graph->new->add_edge(qw(a b));
$g9 = Graph->new(countedged => 1)->add_edge(qw(a b));
$ga = Graph->new->add_edge(qw(a a))->add_edge(qw(a b));
$gb = Graph->new(countedged => 1)->add_edge(qw(a a))->add_edge(qw(a b));
$gc = Graph->new->add_edge(qw(a b))->add_edge(qw(a b));
$gd = Graph->new(countedged => 1)->add_edge(qw(a b))->add_edge(qw(a b));
$ge = Graph->new->add_edge(qw(a a))->add_edge(qw(a b))->add_edge(qw(a b));
$gf = Graph->new(countedged => 1)->add_edge(qw(a a))->add_edge(qw(a b))->add_edge(qw(a b));

ok( $g0->is_simple_graph);
ok(!$g0->is_pseudo_graph);
ok(!$g0->is_multi_graph);

ok( $g1->is_simple_graph);
ok(!$g1->is_pseudo_graph);
ok(!$g1->is_multi_graph);

ok( $g2->is_simple_graph);
ok( $g2->is_pseudo_graph); # a a
ok(!$g2->is_multi_graph);

ok( $g3->is_simple_graph);
ok( $g3->is_pseudo_graph); # a a
ok(!$g3->is_multi_graph);

ok( $g4->is_simple_graph);
ok(!$g4->is_pseudo_graph);
ok(!$g4->is_multi_graph);

ok( $g5->is_simple_graph);
ok(!$g5->is_pseudo_graph);
ok(!$g5->is_multi_graph);

ok( $g6->is_simple_graph);
ok( $g6->is_pseudo_graph); # a a once
ok(!$g6->is_multi_graph);

ok( $g7->is_simple_graph);
ok( $g7->is_pseudo_graph); # a a once
ok(!$g7->is_multi_graph);

ok( $g8->is_simple_graph);
ok(!$g8->is_pseudo_graph);
ok(!$g8->is_multi_graph);

ok( $g9->is_simple_graph);
ok(!$g9->is_pseudo_graph);
ok(!$g9->is_multi_graph);

ok( $ga->is_simple_graph);
ok( $ga->is_pseudo_graph); # a a once
ok(!$ga->is_multi_graph);

ok( $gb->is_simple_graph);
ok( $gb->is_pseudo_graph); # a a once
ok(!$gb->is_multi_graph);

ok( $gc->is_simple_graph);
ok(!$gc->is_pseudo_graph);
ok(!$gc->is_multi_graph);

ok(!$gd->is_simple_graph); # a b twice
ok( $gd->is_pseudo_graph); # a b twice
ok( $gd->is_multi_graph);  # a b twice

ok( $ge->is_simple_graph);
ok( $ge->is_pseudo_graph); # a a once
ok(!$ge->is_multi_graph);

ok(!$gf->is_simple_graph);
ok( $gf->is_pseudo_graph); # a a once, a b twice
ok(!$gf->is_multi_graph);  # a a once, a b twice

$g0 = Graph->new;
$g1 = Graph->new(multiedged => 1);
$g2 = Graph->new->add_edge(qw(a a));
$g3 = Graph->new(multiedged => 1)->add_edge(qw(a a));
$g4 = Graph->new->add_edge(qw(a b));
$g5 = Graph->new(multiedged => 1)->add_edge(qw(a b));
$g6 = Graph->new->add_edge(qw(a a))->add_edge(qw(a b));
$g7 = Graph->new(multiedged => 1)->add_edge(qw(a a))->add_edge(qw(a b));
$g8 = Graph->new->add_edge(qw(a b));
$g9 = Graph->new(multiedged => 1)->add_edge(qw(a b));
$ga = Graph->new->add_edge(qw(a a))->add_edge(qw(a b));
$gb = Graph->new(multiedged => 1)->add_edge(qw(a a))->add_edge(qw(a b));
$gc = Graph->new->add_edge(qw(a b))->add_edge(qw(a b));
$gd = Graph->new(multiedged => 1)->add_edge(qw(a b))->add_edge(qw(a b));
$ge = Graph->new->add_edge(qw(a a))->add_edge(qw(a b))->add_edge(qw(a b));
$gf = Graph->new(multiedged => 1)->add_edge(qw(a a))->add_edge(qw(a b))->add_edge(qw(a b));

ok( $g0->is_simple_graph);
ok(!$g0->is_pseudo_graph);
ok(!$g0->is_multi_graph);

ok( $g1->is_simple_graph);
ok(!$g1->is_pseudo_graph);
ok(!$g1->is_multi_graph);

ok( $g2->is_simple_graph);
ok( $g2->is_pseudo_graph); # a a
ok(!$g2->is_multi_graph);

ok( $g3->is_simple_graph);
ok( $g3->is_pseudo_graph); # a a
ok(!$g3->is_multi_graph);

ok( $g4->is_simple_graph);
ok(!$g4->is_pseudo_graph);
ok(!$g4->is_multi_graph);

ok( $g5->is_simple_graph);
ok(!$g5->is_pseudo_graph);
ok(!$g5->is_multi_graph);

ok( $g6->is_simple_graph);
ok( $g6->is_pseudo_graph); # a a once
ok(!$g6->is_multi_graph);

ok( $g7->is_simple_graph);
ok( $g7->is_pseudo_graph); # a a once
ok(!$g7->is_multi_graph);

ok( $g8->is_simple_graph);
ok(!$g8->is_pseudo_graph);
ok(!$g8->is_multi_graph);

ok( $g9->is_simple_graph);
ok(!$g9->is_pseudo_graph);
ok(!$g9->is_multi_graph);

ok( $ga->is_simple_graph);
ok( $ga->is_pseudo_graph); # a a once
ok(!$ga->is_multi_graph);

ok( $gb->is_simple_graph);
ok( $gb->is_pseudo_graph); # a a once
ok(!$gb->is_multi_graph);

ok( $gc->is_simple_graph);
ok(!$gc->is_pseudo_graph);
ok(!$gc->is_multi_graph);

ok(!$gd->is_simple_graph); # a b twice
ok( $gd->is_pseudo_graph); # a b twice
ok( $gd->is_multi_graph);  # a b twice

ok( $ge->is_simple_graph);
ok( $ge->is_pseudo_graph); # a a once
ok(!$ge->is_multi_graph);

ok(!$gf->is_simple_graph);
ok( $gf->is_pseudo_graph); # a a once, a b twice
ok(!$gf->is_multi_graph);  # a a once, a b twice