Changes between Version 6 and Version 29 of Ticket #31117
- Timestamp:
- Dec 29, 2020, 10:31:09 AM (2 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
Ticket #31117
-
Property
Authors
changed from
David Coudert
toDavid Coudert, Jonathan Kliem
-
Property
Reviewers
changed from
to
Jonathan Kliem
-
Property
Commit
changed from
e56743ba1d0274bfca69e91a01cbaad6af8973ba
to07eaaa59da76507299e6a249c8b3710d6c0173e4
-
Property
Authors
changed from
-
Ticket #31117 – Description
v6 v29 40 40 sage: comp() 41 41 2D 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)42 7.43 µs ± 269 ns per loop (mean ± std. dev. of 7 runs, 100000 loops each) 43 56.4 µs ± 1.91 µs per loop (mean ± std. dev. of 7 runs, 10000 loops each) 44 44 2D 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)45 21.8 µs ± 1.62 µs per loop (mean ± std. dev. of 7 runs, 100000 loops each) 46 300 µs ± 19.9 µs per loop (mean ± std. dev. of 7 runs, 1000 loops each) 47 47 2D 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)48 716 µs ± 40.4 µs per loop (mean ± std. dev. of 7 runs, 1000 loops each) 49 8.65 ms ± 457 µs per loop (mean ± std. dev. of 7 runs, 100 loops each) 50 50 2D 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.91ms per loop (mean ± std. dev. of 7 runs, 10 loops each)51 2.99 ms ± 141 µs per loop (mean ± std. dev. of 7 runs, 100 loops each) 52 34.8 ms ± 1.69 ms per loop (mean ± std. dev. of 7 runs, 10 loops each) 53 53 2D Grid Graph for [500, 500] 54 211 ms ± 8.18 ms per loop (mean ± std. dev. of 7 runs, 1 loopeach)55 1. 09 s ± 24ms per loop (mean ± std. dev. of 7 runs, 1 loop each)54 105 ms ± 4.5 ms per loop (mean ± std. dev. of 7 runs, 10 loops each) 55 1.18 s ± 14.6 ms per loop (mean ± std. dev. of 7 runs, 1 loop each) 56 56 2D Grid Graph for [1000, 1000] 57 1.01 s ± 27.1ms 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)57 596 ms ± 68.3 ms per loop (mean ± std. dev. of 7 runs, 1 loop each) 58 5.83 s ± 1.11 s per loop (mean ± std. dev. of 7 runs, 1 loop each) 59 59 }}} 60 60 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 c ouldbe avoided.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 can be avoided.