#12917: is_cartesian_product
--------------------------------+-------------------------------------------
       Reporter:  ncohen        |         Owner:  tbd          
           Type:  enhancement   |        Status:  needs_work   
       Priority:  major         |     Milestone:  sage-5.1     
      Component:  graph theory  |    Resolution:               
       Keywords:                |   Work issues:               
Report Upstream:  N/A           |     Reviewers:  David Coudert
        Authors:                |     Merged in:               
   Dependencies:                |      Stopgaps:               
--------------------------------+-------------------------------------------
Changes (by dcoudert):

  * status:  needs_review => needs_work
  * reviewer:  => David Coudert


Comment:

 Hello,

 I'm unable to install the patch with sage.5.1.beta1.
 {{{
 --- generic_graph.py
 +++ generic_graph.py
 @@ -13093,25 +13093,33 @@
      def cartesian_product(self, other):
          """
          Returns the Cartesian product of self and other.
 -
 +
          The Cartesian product of `G` and `H` is the graph `L` with vertex
 set
          `V(L)` equal to the Cartesian product of the vertices `V(G)` and
 `V(H)`,
          and `((u,v), (w,x))` is an edge iff either - `(u, w)` is an edge
 of
          self and `v = x`, or - `(v, x)` is an edge of other and `u = w`.
 -
 -        EXAMPLES::
 -
 +
 +        .. SEEALSO::
 +
 +            -
 :meth:`~sage.graphs.graph_decompositions.graph_products.is_cartesian_product`
 +              -- factorization of graphs according to the cartesian
 product
 +
 +            - :mod:`~sage.graphs.graph_decompositions.graph_products`
 +              -- a module on graph products.
 +
 +        EXAMPLES::
 +
              sage: Z = graphs.CompleteGraph(2)
              sage: C = graphs.CycleGraph(5)
              sage: P = C.cartesian_product(Z); P
              Graph on 10 vertices
              sage: P.plot() # long time
 -
 -        ::
 -
 +
 +        ::
 +
              sage: D = graphs.DodecahedralGraph()
              sage: P = graphs.PetersenGraph()
 -            sage: C = D.cartesian_product(P); C
 +            sage: C = D.cartesian_product(P); C
              Graph on 200 vertices
              sage: C.plot() # long time
          """
 }}}

-- 
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12917#comment:2>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to 
[email protected].
For more options, visit this group at 
http://groups.google.com/group/sage-trac?hl=en.

Reply via email to