#19098: implement Taylor 2-graphs for U_3(q) and related srg's
-------------------------------------+-------------------------------------
       Reporter:  dimpase            |        Owner:
           Type:  enhancement        |       Status:  needs_review
       Priority:  major              |    Milestone:  sage-6.9
      Component:  graph theory       |   Resolution:
       Keywords:                     |    Merged in:
        Authors:                     |    Reviewers:
Report Upstream:  N/A                |  Work issues:
         Branch:                     |       Commit:
  u/dimpase/taylor2graphs            |  773d10d2b417f72829fcf0556f2426bd02cd0efb
   Dependencies:  #18972, #18997,    |     Stopgaps:
  #19099                             |
-------------------------------------+-------------------------------------
Changes (by dimpase):

 * status:  new => needs_review


Comment:

 I don't grok that `**kwds` business; the following does not work:
 {{{
 diff --git a/src/sage/combinat/designs/twographs.py
 b/src/sage/combinat/designs/twographs.py
 index c86506b..d3b51c8 100644
 --- a/src/sage/combinat/designs/twographs.py
 +++ b/src/sage/combinat/designs/twographs.py
 @@ -68,8 +68,7 @@ class TwoGraph(IncidenceStructure):
      :mod:`~sage.combinat.designs.twographs` module.

      """
 -    def __init__(self, points=None, blocks=None, incidence_matrix=None,
 -            name=None, check=False, copy=True):
 +    def __init__(self, check=False, **kwds):
          r"""
          Constructor of the class

 @@ -86,9 +85,7 @@ class TwoGraph(IncidenceStructure):
              sage: TwoGraph(p, check=True)
              Incidence structure with 10 points and 60 blocks
          """
 -        IncidenceStructure.__init__(self, points=points, blocks=blocks,
 -                                    incidence_matrix=incidence_matrix,
 -                                    name=name, check=False, copy=copy)
 +        IncidenceStructure.__init__(self, check=False, **kwds)
          if check:  # it is a very slow, O(|points|^4), test...
             from sage.combinat.designs.twographs import is_twograph
             assert is_twograph(self), "the structure is not a 2-graph!"
 }}}

 Any idea? Otherwise, the ticket is ready...

--
Ticket URL: <http://trac.sagemath.org/ticket/19098#comment:9>
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.

Reply via email to