line |
!l |
l&&!r |
l&&r |
condition |
172
|
791 |
0 |
106 |
ref $class and $class->isa("Graph") |
198
|
884 |
9 |
1 |
$vflags & 1 and $vflags & 2 |
201
|
874 |
18 |
1 |
$eflags & 1 and $eflags & 2 |
340
|
38074 |
60 |
55 |
&is_hyperedged && &is_directed |
344
|
65 |
36478 |
1302 |
not $ensure and @non_exist |
353
|
31 |
19946 |
4 |
$Ea and @_ != $Ea + 1 |
355
|
19946 |
14 |
17 |
&is_hyperedged && $directed |
374
|
1162 |
14 |
5 |
&is_hyperedged && &is_directed |
508
|
468 |
6 |
2 |
&is_hyperedged && &is_directed |
516
|
324 |
0 |
2 |
&is_hyperedged && &is_directed |
522
|
4 |
6 |
1 |
&is_hyperedged && &is_directed |
527
|
286 |
0 |
1 |
&is_hyperedged && &is_directed |
533
|
215 |
0 |
1 |
&is_hyperedged && &is_directed |
630
|
1 |
8 |
453 |
@i and $g->[3]->del_path(\@i) |
687
|
0 |
0 |
232 |
@_ > 1 and &has_vertex |
690
|
202 |
25 |
5 |
&is_undirected and &is_self_loop_vertex |
696
|
0 |
0 |
208 |
@_ > 1 and &has_vertex |
699
|
202 |
5 |
1 |
&is_undirected and &is_self_loop_vertex |
704
|
0 |
0 |
42 |
@_ > 1 and &has_vertex |
1040
|
17721 |
20 |
14 |
&is_hyperedged && &is_directed |
1220
|
0 |
8 |
15 |
ref $src eq "ARRAY" and !defined($dst) || ref $dst eq 'ARRAY' |
1232
|
5 |
16 |
32 |
($v->contains($_->[0]) || $v->contains($_->[1])) && ($valid->contains($_->[0]) && $valid->contains($_->[1])) |
1522
|
2 |
1 |
1098 |
@_ == 1 and ref $_[0] eq "ARRAY" |
1557
|
0 |
80 |
0 |
$^P && $] < 5.009003 |
1580
|
10 |
2 |
0 |
exists $opt{'edges'} and exists $opt{'edges_fill'} |
1593
|
12 |
0 |
0 |
$p > 1 and not $g->countedged || $g->multiedged |
1606
|
280 |
6223 |
6070 |
$q and $q == 1 || rand() <= $q |
|
6223 |
2 |
6068 |
$q and $q == 1 || rand() <= $q and not exists $v1_v2{$v1}{$v2} |
|
6225 |
41 |
6027 |
$q and $q == 1 || rand() <= $q and not exists $v1_v2{$v1}{$v2} and $is_directed ? 1 : !exists $v1_v2{$v2}{$v1} |
1781
|
2 |
1 |
2 |
&is_directed && &is_acyclic |
1856
|
413 |
1870 |
0 |
defined $a and ref $a ne "ARRAY" |
1858
|
413 |
46 |
1824 |
defined $a and $a->[0] == $g->[1] |
1961
|
10 |
8 |
2 |
$g->has_union_find and $g->vertices == 1 |
2111
|
1924 |
0 |
14931 |
$e->[0] eq $u and $e->[1] eq $v |
2120
|
708 |
15948 |
2716 |
defined $state->{'pred'}{$u} and $state->{'pred'}{$u} ne $v |
|
16656 |
1809 |
907 |
defined $state->{'pred'}{$u} and $state->{'pred'}{$u} ne $v and $state->{'num'}{$v} < $state->{'num'}{$u} |
2359
|
13 |
0 |
148 |
defined $d{$u} and defined $d{$v} |
2362
|
99 |
48 |
1 |
defined $d and $d{$v} > $d{$u} + $d |
2482
|
100 |
488 |
40 |
$u ne $v and !defined($max) || $l > $max |
2486
|
100 |
510 |
18 |
$u ne $v and !defined($min) || $l < $min |
2512
|
0 |
7 |
2 |
defined $l and !defined($max) || $l > $max |
2523
|
0 |
7 |
2 |
defined $l and !defined($max) || $l > $max |
2540
|
0 |
806 |
289 |
defined $l and !defined($max) || $l > $max |
2557
|
0 |
9 |
0 |
defined $l and !defined($min) || $l < $min |
2569
|
0 |
7 |
2 |
defined $l and !defined($min) || $l < $min |
2587
|
0 |
69 |
20 |
defined $x and $x < $radius |
2600
|
0 |
3 |
7 |
defined $r and $r != $Inf |
2603
|
0 |
0 |
53 |
defined $e and $e != $Inf |
2620
|
270 |
38 |
418 |
defined $A[0] and $u ne $A[0] |
2621
|
126 |
19 |
163 |
defined $A[1] and $v ne $A[1] |
2657
|
6 |
4 |
2 |
$m and $g->get_edge_count($u, @v) > 1 |
2696
|
0 |
0 |
31 |
exists $d1{$da} and keys %{$d0{$da};} == keys %{$d1{$da};} |
2699
|
4 |
0 |
39 |
exists $d1{$da}{$_} && $d0{$da}{$_} == $d1{$da}{$_} |
2733
|
6 |
58 |
15 |
!$c->contains("$u-$_") && $g->has_edge($u, $_) |