| line |
true |
false |
branch |
|
42
|
1 |
39 |
if ($v == 1) |
|
48
|
1 |
38 |
if ($v < 3) |
|
53
|
0 |
38 |
if ($e < $v) |
|
65
|
2 |
36 |
if ($e > $max_edges - $v + 2) |
|
84
|
12 |
2 |
if ($g->has_edge($vertices[0], $vertices[-1])) { } |
|
86
|
1 |
49 |
unless ($g->has_edge($vertices[$counter], $vertices[$counter + 1])) |
|
116
|
5 |
2849 |
if ($g->degree($vertex) < 2) |
|
119
|
5 |
0 |
$params->{'transformed'} ? : |
|
136
|
207 |
7 |
if $g->is_biconnected |
|
139
|
1 |
6 |
$params->{'transformed'} ? : |
|
159
|
207 |
1 |
if $g->is_edge_connected |
|
163
|
0 |
1 |
$params->{'transformed'} ? : |
|
189
|
2 |
38 |
if $v < 3 |
|
194
|
36 |
11 |
if ($g->degree($vertex) < $half_v) |
|
216
|
1 |
218 |
if $v < 3 |
|
220
|
267 |
289 |
if $vertex1 == $vertex2 |
|
221
|
62 |
227 |
if $g->has_edge($vertex1, $vertex2) |
|
223
|
216 |
11 |
if $sum_of_degrees < $v |
|
244
|
31 |
2346 |
if ($degree > 2) |
|
246
|
16 |
15 |
$params->{'transformed'} ? : |
|
266
|
32 |
131 |
if ($required_graph->is_connected) |
|
272
|
21 |
11 |
unless (@degree1_vertices) |
|
275
|
0 |
21 |
$params->{'transformed'} ? : |
|
282
|
7 |
4 |
if ($g->has_edge(@degree1_vertices)) { } |
|
283
|
7 |
0 |
unless ($required_graph->has_edge(@degree1_vertices)) |
|
289
|
0 |
7 |
$params->{'transformed'} ? : |
|
296
|
0 |
4 |
$params->{'transformed'} ? : |
|
313
|
15 |
116 |
if ($required_graph->has_a_cycle) |
|
315
|
0 |
15 |
$params->{'transformed'} ? : |