#19136: NO and NU graphs
-------------------------+-------------------------------------------------
Reporter: | Owner:
dimpase | Status: positive_review
Type: | Milestone: sage-6.9
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers: Nathann Cohen
theory | Work issues:
Keywords: | Commit:
Authors: Dima | dbc50b1b074afe22f4fb32542e8b1ca76c41525e
Pasechnik | Stopgaps:
Report Upstream: N/A |
Branch: |
u/dimpase/NONU |
Dependencies: |
#19098, #19180 |
-------------------------+-------------------------------------------------
Changes (by ncohen):
* status: needs_review => positive_review
Comment:
Okay, let's get this merged. You and I seldom agree on anything when it
comes to design, and the code works well anyway. I have been building all
graphs for which we detect a constructions up to 1000+, and there is no
problem there: we get the SRG we ask for, each time. And there is no
N<whatever> in the list of graphs we miss.
Thanks,
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/19136#comment:34>
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/d/optout.
