#14589: binary matrices, dense graphs, and faster is_strongly_regular
---------------------------------+----------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.12
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: Nathann Cohen | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: #14805 | Stopgaps:
---------------------------------+----------------------------------
Comment (by jason):
Thanks for doing this. Often the first thing I do is to convert the graph
to an array of bitsets and then work with that. I do this a lot in the
minimum rank library, for example:
https://github.com/jasongrout/minimum_rank/blob/master/zero_forcing_wavefront.pyx#L124
Next time I write some code like this, I'll have to look at this
implementation. When I get some time to do research coding work, if this
hasn't been reviewed, I'll have to review this!
--
Ticket URL: <http://trac.sagemath.org/ticket/14589#comment:13>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/groups/opt_out.
