#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):
Hellooo !
> Line 67. g.vertices() == range(n)
Oh, right. But in this case the vertices are integers. It indeed relies on
the fact that vertices are sorted (and they are), but there is no problem
if the natural order on the vertices is not total. The equality will be
false in that case.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/14589#comment:23>
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.
