3 | | And for some reason I was not able to build the doc, but I guess it comes from my version of sphinx, but I will give it another try a soon as I can recompile it. |
| 3 | With the patch applied |
| 4 | {{{ |
| 5 | sage: g = graphs.PaleyGraph(primes_first_n(70)[-1]) |
| 6 | sage: %time g.is_strongly_regular() |
| 7 | CPU times: user 0.16 s, sys: 0.00 s, total: 0.16 s |
| 8 | Wall time: 0.16 s |
| 9 | True |
| 10 | }}} |
| 11 | |
| 12 | Without it |
| 13 | {{{ |
| 14 | sage: g = graphs.PaleyGraph(primes_first_n(70)[-1]) |
| 15 | sage: %time g.is_strongly_regular() |
| 16 | CPU times: user 20.43 s, sys: 0.00 s, total: 20.43 s |
| 17 | Wall time: 20.44 s |
| 18 | True |
| 19 | }}} |
| 20 | |
| 21 | Ahhhh.. It is so nice to implement an algorithm with the right data structure ! `:-P` |