| line |
true |
false |
branch |
|
341
|
154 |
663 |
if defined $eNewick |
|
342
|
0 |
817 |
if defined $edgesR |
|
343
|
183 |
634 |
if defined $graph |
|
344
|
479 |
338 |
if defined $tree |
|
345
|
0 |
817 |
if (not defined $leavesR and defined $numleaves) |
|
349
|
1 |
816 |
if defined $mudataR and defined $leavesR |
|
408
|
1916 |
1320 |
if (!$subrtlng eq '') { } |
|
414
|
444 |
2792 |
if (!$subrttype eq '') |
|
419
|
3236 |
0 |
if (not defined $labels->{$subrtid} or $labels->{$subrtid} eq '') { } |
|
|
0 |
0 |
elsif ($labels->{$subrtid} ne $subrtlbl and $subrtlbl ne '') { } |
|
426
|
880 |
2356 |
if ($subblock ne '') |
|
437
|
6104 |
4 |
if ($rt eq $block) |
|
455
|
3572 |
660 |
if (index($string, '#') == -1) { } |
|
460
|
682 |
2890 |
if (not defined $label or $label eq '') { } |
|
496
|
1109 |
71407 |
if ($char eq '(') |
|
499
|
2838 |
69678 |
if ($char eq ')') |
|
500
|
1729 |
1109 |
if ($level == 1) |
|
506
|
1507 |
71009 |
if ($char eq ',' and $level == 1) |
|
528
|
9 |
4 |
unless exists $seen{$node} |
|
538
|
15 |
63 |
if ($mu->geq_poset($$mus{$nodes[$j]})) |
|
598
|
0 |
1462 |
unless $self->{'graph'}->is_dag |
|
609
|
2520 |
7454 |
unless (defined $self->{'labels'}{$node}) |
|
630
|
847 |
645 |
if ($self->is_hybrid_node($v1) or $self->is_hybrid_node($v2) or $self->graph->is_reachable($v2, $u1) or $u1 eq $u2 and $v1 eq $v2 or not scalar grep({$self->is_tree_node($_) if $_ ne $v2;} $self->graph->successors($u2))) |
|
634
|
917 |
1103 |
if $_ ne $v2 |
|
691
|
50823 |
7545 |
if defined $self->{'h'}{$_} |
|
717
|
2806 |
4397 |
if ($self->{'graph'}->out_degree($node) == 0) |
|
733
|
1 |
0 |
if ($self->{'graph'}->in_degree($node) == 0) |
|
749
|
837 |
326 |
if ($self->{'graph'}->in_degree($node) <= 1) |
|
765
|
2856 |
12625 |
if ($self->{'graph'}->in_degree($node) > 1) |
|
776
|
1505 |
417 |
if ($g->in_degree($son) == 1) |
|
795
|
8794 |
301 |
if (defined $self->{'is_tree_child'}) |
|
801
|
0 |
2443 |
unless $graph->out_degree($node) == 0 or has_tree_child($graph, $node) |
|
986
|
7 |
8 |
if (scalar @h) { } |
|
1065
|
0 |
4546 |
unless $comp->compare($net1->{'leaves'}, $net2->{'leaves'}) |
|
1066
|
0 |
4546 |
unless $net1->is_tree_child |
|
1068
|
0 |
4546 |
unless $net2->is_tree_child |
|
1075
|
21218 |
208947 |
if (not exists $matched1{$node1} || exists $matched2{$node2} and $net1->{'mudata'}{$node1} == $net2->{'mudata'}{$node2}) |
|
1114
|
24271 |
635 |
if defined $self->{'mudata_string'} |
|
1136
|
0 |
12 |
unless $self->{'numroots'} == 1 |
|
1144
|
19 |
17 |
if ($graph->is_reachable($u, $leaf)) { } |
|
1145
|
2 |
17 |
if ($graphPruned->is_reachable($root, $leaf)) { } |
|
1178
|
1 |
0 |
unless defined $self->{'tripartitions'} |
|
1188
|
0 |
1 |
unless $comp->compare($net1->{'leaves'}, $net2->{'leaves'}) |
|
1189
|
0 |
1 |
unless $net1->is_tree_child |
|
1191
|
0 |
1 |
unless $net2->is_tree_child |
|
1193
|
0 |
1 |
unless $net1->is_time_consistent |
|
1195
|
0 |
1 |
unless $net2->is_time_consistent |
|
1197
|
0 |
1 |
unless defined $net1->{'tripartitions'} |
|
1198
|
1 |
0 |
unless defined $net2->{'tripartitions'} |
|
1205
|
5 |
18 |
if ($net1->{'tripartitions'}{$edge1->[1]} eq $net2->{'tripartitions'}{$edge2->[1]}) |
|
1211
|
2 |
5 |
unless ($matched) |
|
1216
|
3 |
14 |
if ($net1->{'tripartitions'}{$edge1->[1]} eq $net2->{'tripartitions'}{$edge2->[1]}) |
|
1222
|
1 |
3 |
unless ($matched) |
|
1244
|
3 |
1 |
unless exists $self->{'has_temporal_representation'} |
|
1261
|
1 |
0 |
if ($self->is_time_consistent) |
|
1279
|
9 |
0 |
if (my(@svs) = $quotient->predecessorless_vertices) { } |
|
1344
|
0 |
0 |
unless $mus->{$b} <=> $mus->{$a} |
|
1348
|
0 |
0 |
if ($contracted->in_degree($elem) == 1) |
|
1410
|
0 |
2 |
unless $comp->compare($net1->{'leaves'}, $net2->{'leaves'}) |
|
1412
|
1 |
1 |
if (defined $params{'-metric'} and $params{'-metric'} eq 'Hamming') { } |
|
1440
|
10 |
8 |
if (defined $nodes2[$alignment[$i]]) |
|
1475
|
0 |
90 |
unless (defined $distance) |
|
1478
|
45 |
45 |
if ($distance eq 'Hamming') { } |
|
1483
|
36 |
54 |
if ($net1->is_tree_node($v1) and $net2->is_hybrid_node($v2) or $net2->is_tree_node($v2) and $net1->is_hybrid_node($v1)) |
|
1518
|
0 |
0 |
if (defined $position1{$leaves2[$j]}) |
|
1529
|
0 |
0 |
if ($$mu[$position1{$leaf}] > 0) |
|
1539
|
0 |
0 |
if ($$mu[$position2{$leaf}] > 0) |
|
1576
|
606 |
660 |
if ($self->is_leaf($node) or defined $seen->{$node}) { } |
|
1597
|
300 |
966 |
if ($self->is_hybrid_node($node)) { } |
|
1599
|
294 |
6 |
if ($lbl =~ /#/) |
|
1604
|
6 |
294 |
if (defined $parent and $self->graph->has_edge_attribute($parent, $node, 'type')) |
|
1612
|
0 |
1266 |
if (defined $parent and $self->graph->has_edge_weight($parent, $node)) |
|
1643
|
574 |
588 |
if ($self->is_leaf($node) or defined $seen->{$node}) { } |
|
1664
|
300 |
862 |
if ($self->is_hybrid_node($node)) { } |
|
1666
|
294 |
6 |
if ($lbl =~ /#/) |
|
1671
|
6 |
294 |
if (defined $parent and $self->graph->has_edge_attribute($parent, $node, 'type')) |
|
1677
|
858 |
4 |
if (defined $self->{'labels'}{$node} and $self->{'labels'}{$node} ne '') { } |
|
1684
|
0 |
1162 |
if (defined $parent and $self->graph->has_edge_weight($parent, $node)) |
|
1775
|
999 |
0 |
if (exists $self->{'labels'}{$node}) { } |
|
1782
|
0 |
135 |
if (exists $self->{'has_temporal_representation'}) |
|
1784
|
0 |
0 |
if ($self->{'has_temporal_representation'}) { } |
|
1793
|
0 |
135 |
if (exists $self->{'tripartitions'}) |