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 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458
|
Wathen: nx 4 ny 4 n 65 nz 817 method 0, time: 0.000 sec
number of nodes: 65
method 5: vector assign and reduce:
BFS time in seconds: 0.000103
nodes reachable from node 0: 65 out of 65
max BFS level: 5
method 5: same but check each result
BFS time in seconds: 0.000053
nodes reachable from node 0: 65 out of 65
max BFS level: 5
method 6: apply unary operator
BFS time in seconds: 0.000045
nodes reachable from node 0: 65 out of 65
max BFS level: 5
method 6: same but check each result
BFS time in seconds: 0.000035
nodes reachable from node 0: 65 out of 65
max BFS level: 5
random 5 by 5, nz: 21, method 1 time 0.000 sec
number of nodes: 5
method 5: vector assign and reduce:
BFS time in seconds: 0.000066
nodes reachable from node 0: 5 out of 5
max BFS level: 3
method 5: same but check each result
BFS time in seconds: 0.000024
nodes reachable from node 0: 5 out of 5
max BFS level: 3
method 6: apply unary operator
BFS time in seconds: 0.000029
nodes reachable from node 0: 5 out of 5
max BFS level: 3
method 6: same but check each result
BFS time in seconds: 0.000022
nodes reachable from node 0: 5 out of 5
max BFS level: 3
matrix 3 by 3, 3 entries, from stdin
number of nodes: 3
method 5: vector assign and reduce:
BFS time in seconds: 0.000048
nodes reachable from node 0: 1 out of 3
max BFS level: 1
method 5: same but check each result
BFS time in seconds: 0.000018
nodes reachable from node 0: 1 out of 3
max BFS level: 1
method 6: apply unary operator
BFS time in seconds: 0.000022
nodes reachable from node 0: 1 out of 3
max BFS level: 1
method 6: same but check each result
BFS time in seconds: 0.000015
nodes reachable from node 0: 1 out of 3
max BFS level: 1
matrix 4 by 4, 8 entries, from stdin
number of nodes: 4
method 5: vector assign and reduce:
BFS time in seconds: 0.000050
nodes reachable from node 0: 2 out of 4
max BFS level: 2
method 5: same but check each result
BFS time in seconds: 0.000019
nodes reachable from node 0: 2 out of 4
max BFS level: 2
method 6: apply unary operator
BFS time in seconds: 0.000025
nodes reachable from node 0: 2 out of 4
max BFS level: 2
method 6: same but check each result
BFS time in seconds: 0.000018
nodes reachable from node 0: 2 out of 4
max BFS level: 2
------------------- this fails:
GraphBLAS error: GrB_DOMAIN_MISMATCH
function: GrB_Monoid_new_INT32 (&monoid, op, identity)
Identity type [int32_t]
must be identical to monoid operator z=or(x,y) of type [bool]
------------------- this is OK: 0 (should be GrB_SUCCESS = 0)
matrix 4 by 4, 14 entries, from stdin
number of nodes: 4
method 5: vector assign and reduce:
BFS time in seconds: 0.000065
nodes reachable from node 0: 4 out of 4
max BFS level: 2
method 5: same but check each result
BFS time in seconds: 0.000019
nodes reachable from node 0: 4 out of 4
max BFS level: 2
method 6: apply unary operator
BFS time in seconds: 0.000026
nodes reachable from node 0: 4 out of 4
max BFS level: 2
method 6: same but check each result
BFS time in seconds: 0.000017
nodes reachable from node 0: 4 out of 4
max BFS level: 2
------------------- this fails:
GraphBLAS error: GrB_DOMAIN_MISMATCH
function: GrB_Monoid_new_INT32 (&monoid, op, identity)
Identity type [int32_t]
must be identical to monoid operator z=or(x,y) of type [bool]
------------------- this is OK: 0 (should be GrB_SUCCESS = 0)
matrix 7 by 7, 16 entries, from stdin
number of nodes: 7
method 5: vector assign and reduce:
BFS time in seconds: 0.000052
nodes reachable from node 0: 7 out of 7
max BFS level: 5
method 5: same but check each result
BFS time in seconds: 0.000030
nodes reachable from node 0: 7 out of 7
max BFS level: 5
method 6: apply unary operator
BFS time in seconds: 0.000039
nodes reachable from node 0: 7 out of 7
max BFS level: 5
method 6: same but check each result
BFS time in seconds: 0.000030
nodes reachable from node 0: 7 out of 7
max BFS level: 5
matrix 304 by 304, 876 entries, from stdin
number of nodes: 304
method 5: vector assign and reduce:
BFS time in seconds: 0.000144
nodes reachable from node 0: 304 out of 304
max BFS level: 17
method 5: same but check each result
BFS time in seconds: 0.000100
nodes reachable from node 0: 304 out of 304
max BFS level: 17
method 6: apply unary operator
BFS time in seconds: 0.000116
nodes reachable from node 0: 304 out of 304
max BFS level: 17
method 6: same but check each result
BFS time in seconds: 0.000107
nodes reachable from node 0: 304 out of 304
max BFS level: 17
matrix 48 by 48, 400 entries, from stdin
number of nodes: 48
method 5: vector assign and reduce:
BFS time in seconds: 0.000059
nodes reachable from node 0: 48 out of 48
max BFS level: 4
method 5: same but check each result
BFS time in seconds: 0.000030
nodes reachable from node 0: 48 out of 48
max BFS level: 4
method 6: apply unary operator
BFS time in seconds: 0.000035
nodes reachable from node 0: 48 out of 48
max BFS level: 4
method 6: same but check each result
BFS time in seconds: 0.000030
nodes reachable from node 0: 48 out of 48
max BFS level: 4
matrix 4884 by 4884, 290378 entries, from stdin
number of nodes: 4884
method 5: vector assign and reduce:
BFS time in seconds: 0.001652
nodes reachable from node 0: 4810 out of 4884
max BFS level: 44
method 5: same but check each result
BFS time in seconds: 0.001546
nodes reachable from node 0: 4810 out of 4884
max BFS level: 44
method 6: apply unary operator
BFS time in seconds: 0.001583
nodes reachable from node 0: 4810 out of 4884
max BFS level: 44
method 6: same but check each result
BFS time in seconds: 0.001540
nodes reachable from node 0: 4810 out of 4884
max BFS level: 44
matrix 183 by 183, 1585 entries, from stdin
number of nodes: 183
method 5: vector assign and reduce:
BFS time in seconds: 0.000083
nodes reachable from node 0: 183 out of 183
max BFS level: 4
method 5: same but check each result
BFS time in seconds: 0.000042
nodes reachable from node 0: 183 out of 183
max BFS level: 4
method 6: apply unary operator
BFS time in seconds: 0.000048
nodes reachable from node 0: 183 out of 183
max BFS level: 4
method 6: same but check each result
BFS time in seconds: 0.000038
nodes reachable from node 0: 183 out of 183
max BFS level: 4
matrix 63 by 63, 246 entries, from stdin
number of nodes: 63
method 5: vector assign and reduce:
BFS time in seconds: 0.000065
nodes reachable from node 0: 63 out of 63
max BFS level: 6
method 5: same but check each result
BFS time in seconds: 0.000036
nodes reachable from node 0: 63 out of 63
max BFS level: 6
method 6: apply unary operator
BFS time in seconds: 0.000043
nodes reachable from node 0: 63 out of 63
max BFS level: 6
method 6: same but check each result
BFS time in seconds: 0.000036
nodes reachable from node 0: 63 out of 63
max BFS level: 6
matrix 63 by 63, 246 entries, from stdin
number of nodes: 63
method 5: vector assign and reduce:
BFS time in seconds: 0.000063
nodes reachable from node 0: 63 out of 63
max BFS level: 6
method 5: same but check each result
BFS time in seconds: 0.000035
nodes reachable from node 0: 63 out of 63
max BFS level: 6
method 6: apply unary operator
BFS time in seconds: 0.000047
nodes reachable from node 0: 63 out of 63
max BFS level: 6
method 6: same but check each result
BFS time in seconds: 0.000035
nodes reachable from node 0: 63 out of 63
max BFS level: 6
matrix 78 by 78, 204 entries, from stdin
number of nodes: 78
method 5: vector assign and reduce:
BFS time in seconds: 0.000087
nodes reachable from node 0: 78 out of 78
max BFS level: 10
method 5: same but check each result
BFS time in seconds: 0.000061
nodes reachable from node 0: 78 out of 78
max BFS level: 10
method 6: apply unary operator
BFS time in seconds: 0.000071
nodes reachable from node 0: 78 out of 78
max BFS level: 10
method 6: same but check each result
BFS time in seconds: 0.000057
nodes reachable from node 0: 78 out of 78
max BFS level: 10
matrix 982 by 982, 99840 entries, from stdin
number of nodes: 982
method 5: vector assign and reduce:
BFS time in seconds: 0.000507
nodes reachable from node 0: 933 out of 982
max BFS level: 5
method 5: same but check each result
BFS time in seconds: 0.000453
nodes reachable from node 0: 933 out of 982
max BFS level: 5
method 6: apply unary operator
BFS time in seconds: 0.000453
nodes reachable from node 0: 933 out of 982
max BFS level: 5
method 6: same but check each result
BFS time in seconds: 0.000441
nodes reachable from node 0: 933 out of 982
max BFS level: 5
matrix 67 by 67, 576 entries, from stdin
number of nodes: 67
method 5: vector assign and reduce:
BFS time in seconds: 0.000068
nodes reachable from node 0: 67 out of 67
max BFS level: 5
method 5: same but check each result
BFS time in seconds: 0.000034
nodes reachable from node 0: 67 out of 67
max BFS level: 5
method 6: apply unary operator
BFS time in seconds: 0.000044
nodes reachable from node 0: 67 out of 67
max BFS level: 5
method 6: same but check each result
BFS time in seconds: 0.000034
nodes reachable from node 0: 67 out of 67
max BFS level: 5
Wathen: nx 200 ny 200 n 120801 nz 1883201 method 0, time: 0.114 sec
number of nodes: 120801
method 5: vector assign and reduce:
BFS time in seconds: 0.062683
nodes reachable from node 0: 120801 out of 120801
max BFS level: 201
method 5: same but check each result
BFS time in seconds: 0.048605
nodes reachable from node 0: 120801 out of 120801
max BFS level: 201
method 6: apply unary operator
BFS time in seconds: 0.044805
nodes reachable from node 0: 120801 out of 120801
max BFS level: 201
method 6: same but check each result
BFS time in seconds: 0.047597
nodes reachable from node 0: 120801 out of 120801
max BFS level: 201
random 10000 by 10000, nz: 199777, method 0 time 0.023 sec
number of nodes: 10000
method 5: vector assign and reduce:
BFS time in seconds: 0.001472
nodes reachable from node 0: 10000 out of 10000
max BFS level: 5
method 5: same but check each result
BFS time in seconds: 0.001356
nodes reachable from node 0: 10000 out of 10000
max BFS level: 5
method 6: apply unary operator
BFS time in seconds: 0.001365
nodes reachable from node 0: 10000 out of 10000
max BFS level: 5
method 6: same but check each result
BFS time in seconds: 0.001336
nodes reachable from node 0: 10000 out of 10000
max BFS level: 5
random 10000 by 10000, nz: 199777, method 1 time 0.019 sec
number of nodes: 10000
method 5: vector assign and reduce:
BFS time in seconds: 0.001486
nodes reachable from node 0: 10000 out of 10000
max BFS level: 5
method 5: same but check each result
BFS time in seconds: 0.001357
nodes reachable from node 0: 10000 out of 10000
max BFS level: 5
method 6: apply unary operator
BFS time in seconds: 0.001401
nodes reachable from node 0: 10000 out of 10000
max BFS level: 5
method 6: same but check each result
BFS time in seconds: 0.001358
nodes reachable from node 0: 10000 out of 10000
max BFS level: 5
random 100000 by 100000, nz: 19980256, method 0 time 2.289 sec
number of nodes: 100000
method 5: vector assign and reduce:
BFS time in seconds: 0.057052
nodes reachable from node 0: 100000 out of 100000
max BFS level: 4
method 5: same but check each result
BFS time in seconds: 0.048007
nodes reachable from node 0: 100000 out of 100000
max BFS level: 4
method 6: apply unary operator
BFS time in seconds: 0.046741
nodes reachable from node 0: 100000 out of 100000
max BFS level: 4
method 6: same but check each result
BFS time in seconds: 0.047456
nodes reachable from node 0: 100000 out of 100000
max BFS level: 4
random 100000 by 100000, nz: 19980256, method 1 time 1.723 sec
number of nodes: 100000
method 5: vector assign and reduce:
BFS time in seconds: 0.057582
nodes reachable from node 0: 100000 out of 100000
max BFS level: 4
method 5: same but check each result
BFS time in seconds: 0.049565
nodes reachable from node 0: 100000 out of 100000
max BFS level: 4
method 6: apply unary operator
BFS time in seconds: 0.046042
nodes reachable from node 0: 100000 out of 100000
max BFS level: 4
method 6: same but check each result
BFS time in seconds: 0.046488
nodes reachable from node 0: 100000 out of 100000
max BFS level: 4
|