line |
true |
false |
branch |
30
|
60 |
10 |
unless ($want_transitive) |
32
|
1 |
59 |
if ($want_path_count) { } |
42
|
421 |
12 |
if $want_reflexive |
44
|
15191 |
1158 |
unless vec $ai[$iu], $iv, 1 |
45
|
231 |
927 |
if ($want_path_count or not defined $di[$iu][$iv]) { } |
|
4 |
1842 |
elsif ($multi and ref $di[$iu][$iv] eq 'HASH') { } |
46
|
5 |
226 |
$iu == $iv ? : |
50
|
737 |
421 |
unless $iu == $iv |
60
|
14550 |
1903 |
unless vec $aiu, $iv, 1 |
61
|
55 |
1848 |
if ($want_transitive) |
63
|
4 |
139 |
if $iw != $iv and vec $aiv, $iw, 1 and not vec($aiu, $iw, 1) |
72
|
933 |
915 |
if ($aiu ne $aiuo) |
74
|
0 |
933 |
if $iv == $iu |
76
|
20 |
1828 |
unless $want_path |
80
|
57008 |
24347 |
unless vec $aiv, $iw, 1 |
81
|
13 |
24334 |
if ($want_path_count) |
82
|
1 |
4 |
if $iu != $iv and $iv != $iw and $iw != $iu |
88
|
6729 |
17605 |
if (not defined $d0 or $d1 < $d0) |
91
|
6728 |
1 |
if $want_path_vertices |
97
|
6 |
60 |
if $want_transitive |
100
|
60 |
0 |
if defined $dm |
101
|
60 |
0 |
if defined $sm |
110
|
1 |
69 |
if exists $opt{'attribute_name'} |
112
|
0 |
70 |
if $opt{'distance_matrix'} |
114
|
29 |
41 |
if exists $opt{'path'} |
120
|
10 |
60 |
if exists $opt{'is_transitive'} |
122
|
10 |
60 |
unless defined $want_reflexive |
125
|
1 |
69 |
if $want_path_count |
135
|
9 |
34461 |
unless exists $tc->[3]{$v} |
142
|
6 |
13848 |
unless $tc->has_vertices($u, $v) |
143
|
854 |
12994 |
if $u eq $v |
148
|
10 |
6 |
if @_ == 1 |
151
|
0 |
6 |
unless $tc->has_vertices($u, $v) |
162
|
3 |
3004 |
unless $tc->has_vertices($u, $v) |
163
|
256 |
2748 |
if $u eq $v |
169
|
9 |
371 |
if $u eq $v |
170
|
0 |
371 |
unless $tc->has_vertices($u, $v) |
176
|
15 |
252 |
unless $tc->is_reachable($u, $v) |
177
|
40 |
5 |
wantarray ? : |
|
45 |
207 |
if $u eq $v |
180
|
0 |
353 |
unless defined($u = $tc->path_successor($u, $v)) |
183
|
207 |
0 |
if @v |
189
|
0 |
29 |
if $u eq $v |
191
|
1 |
28 |
if exists $seen->{$u} |
194
|
12 |
16 |
if $tc->[4]->has_edge($u, $v) |