Changes between Version 6 and Version 29 of Ticket #31117


Ignore:
Timestamp:
Dec 29, 2020, 10:31:09 AM (2 years ago)
Author:
dcoudert
Comment:

Legend:

Unmodified
Added
Removed
Modified

  • Ticket #31117

    • Property Authors changed from David Coudert to David Coudert, Jonathan Kliem
    • Property Reviewers changed from to Jonathan Kliem
    • Property Commit changed from e56743ba1d0274bfca69e91a01cbaad6af8973ba to 07eaaa59da76507299e6a249c8b3710d6c0173e4

  • Ticket #31117 – Description

    v6 v29  
    4040sage: comp()                                                                                                                                       
    41412D Grid Graph for [5, 5]
    42 17.3 µs ± 349 ns per loop (mean ± std. dev. of 7 runs, 100000 loops each)
    43 66.6 µs ± 1.49 µs per loop (mean ± std. dev. of 7 runs, 10000 loops each)
     427.43 µs ± 269 ns per loop (mean ± std. dev. of 7 runs, 100000 loops each)
     4356.4 µs ± 1.91 µs per loop (mean ± std. dev. of 7 runs, 10000 loops each)
    44442D Grid Graph for [10, 10]
    45 58.5 µs ± 1.43 µs per loop (mean ± std. dev. of 7 runs, 10000 loops each)
    46 268 µs ± 16 µs per loop (mean ± std. dev. of 7 runs, 1000 loops each)
     4521.8 µs ± 1.62 µs per loop (mean ± std. dev. of 7 runs, 100000 loops each)
     46300 µs ± 19.9 µs per loop (mean ± std. dev. of 7 runs, 1000 loops each)
    47472D Grid Graph for [50, 50]
    48 1.73 ms ± 31.2 µs per loop (mean ± std. dev. of 7 runs, 1000 loops each)
    49 8.26 ms ± 245 µs per loop (mean ± std. dev. of 7 runs, 100 loops each)
     48716 µs ± 40.4 µs per loop (mean ± std. dev. of 7 runs, 1000 loops each)
     498.65 ms ± 457 µs per loop (mean ± std. dev. of 7 runs, 100 loops each)
    50502D Grid Graph for [100, 100]
    51 7.49 ms ± 137 µs per loop (mean ± std. dev. of 7 runs, 100 loops each)
    52 34.7 ms ± 1.91 ms per loop (mean ± std. dev. of 7 runs, 10 loops each)
     512.99 ms ± 141 µs per loop (mean ± std. dev. of 7 runs, 100 loops each)
     5234.8 ms ± 1.69 ms per loop (mean ± std. dev. of 7 runs, 10 loops each)
    53532D Grid Graph for [500, 500]
    54 211 ms ± 8.18 ms per loop (mean ± std. dev. of 7 runs, 1 loop each)
    55 1.09 s ± 24 ms per loop (mean ± std. dev. of 7 runs, 1 loop each)
     54105 ms ± 4.5 ms per loop (mean ± std. dev. of 7 runs, 10 loops each)
     551.18 s ± 14.6 ms per loop (mean ± std. dev. of 7 runs, 1 loop each)
    56562D Grid Graph for [1000, 1000]
    57 1.01 s ± 27.1 ms per loop (mean ± std. dev. of 7 runs, 1 loop each)
    58 5.27 s ± 206 ms per loop (mean ± std. dev. of 7 runs, 1 loop each)
     57596 ms ± 68.3 ms per loop (mean ± std. dev. of 7 runs, 1 loop each)
     585.83 s ± 1.11 s per loop (mean ± std. dev. of 7 runs, 1 loop each)
    5959}}}
    6060
    61 Another improvement is to avoid using `in_neighbors` and `out_neighbors` since these methods return lists of vertices and behind we have some mallocs of arrays. So a lot of operations that could be avoided.
     61Another improvement is to avoid using `in_neighbors` and `out_neighbors` since these methods return lists of vertices and behind we have some mallocs of arrays. So a lot of operations that can be avoided.