#14589: binary matrices, dense graphs, and faster is_strongly_regular
-------------------------+-------------------------------------------------
Reporter: | Owner: jason, ncohen, rlm
ncohen | Status: needs_review
Type: | Milestone: sage-6.1
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: | Commit:
Authors: | b56444ba216f3c2e6d7f20e34daf80f5d5aec781
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
u/ncohen/14589 |
Dependencies: |
#14805 |
-------------------------+-------------------------------------------------
Comment (by ncohen):
> Yes didn't you?
Well if I did I do not remember where `:-P`
> For me they are veeeery annoying so I assumed they were for everyone.
Hmmmm.. It is true that a graph is a collection of pairs, and that you
always have to explain "what the hell all these `None` are" when you show
the result of `g.edges()` to beginners... `:-/`
> Anyways, this is all I got to say about the patch. It looks good to me
provided u changed the above things and ran the doctests (which I did not)
Well the patchbot complains but the two errors seem unrelated.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/14589#comment:21>
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.
