Opened 9 years ago

Last modified 9 years ago

#14589 closed enhancement

binary matrices, dense graphs, and faster is_strongly_regular — at Version 2

Reported by: Nathann Cohen Owned by: jason, ncohen, rlm
Priority: major Milestone: sage-6.1
Component: graph theory Keywords:
Cc: Slani, Stefan, Jernej Azarija, Dima Pasechnik Merged in:
Authors: Nathann Cohen Reviewers:
Report Upstream: N/A Work issues:
Branch: Commit:
Dependencies: Stopgaps:

Status badges

Description (last modified by Nathann Cohen)

As the title says !!

With the patch applied

sage: g = graphs.PaleyGraph(primes_first_n(70)[-1])
sage: %time g.is_strongly_regular()
CPU times: user 0.16 s, sys: 0.00 s, total: 0.16 s
Wall time: 0.16 s
True

Without it

sage: g = graphs.PaleyGraph(primes_first_n(70)[-1])
sage: %time g.is_strongly_regular()
CPU times: user 20.43 s, sys: 0.00 s, total: 20.43 s
Wall time: 20.44 s
True

Ahhhh.. It is so nice to implement an algorithm with the right data structure ! :-P

Nathann

Change History (2)

comment:1 Changed 9 years ago by Nathann Cohen

Status: newneeds_review

comment:2 Changed 9 years ago by Nathann Cohen

Cc: Dima Pasechnik added; jernej dimpae removed
Description: modified (diff)
Note: See TracTickets for help on using tickets.