#9584: Weird timeouts in doctesting generic_graph with 4.5.2.alpha0 on some
systems
-----------------------+----------------------------------------------------
   Reporter:  mpatel   |       Owner:  mvngu                                    
       
       Type:  defect   |      Status:  new                                      
       
   Priority:  blocker  |   Milestone:  sage-4.5.2                               
       
  Component:  doctest  |    Keywords:  generic_graph, generic graph, time-out, 
time out
     Author:           |    Upstream:  N/A                                      
       
   Reviewer:           |      Merged:                                           
       
Work_issues:           |  
-----------------------+----------------------------------------------------

Comment(by jhpalmieri):

 Hi Nathann,

 > Sorry for the trouble !!!!!!!!!!!!!!!!!!

 I cc'ed you on the ticket not because I thought you caused trouble, but
 because I knew you had worked on the file and could suggest ways to fix
 it.

 So are you suggesting this patch?  It seems to work for me.
 {{{
 #!diff
 diff -r af5f40a73eda sage/graphs/generic_graph.py
 --- a/sage/graphs/generic_graph.py      Wed Jul 21 20:13:55 2010 -0700
 +++ b/sage/graphs/generic_graph.py      Sun Jul 25 10:53:22 2010 -0400
 @@ -3424,13 +3424,17 @@
          By Edmond's theorem, a graph which is `k`-connected always has
 `k` edge-disjoint
          arborescences, regardless of the root we pick::

 -            sage: g = digraphs.RandomDirectedGNP(30,.3)
 -            sage: k = Integer(g.edge_connectivity())
 +            sage: n = 20
 +            sage: k = 3
 +            sage: g = DiGraph()
 +            sage: g.add_edges( (Integer(i),Integer(Mod(i+j,n))) for i in
 range(n) for j in range(1
 ,k+1))
 +            sage: k == g.edge_connectivity()
 +            True
              sage: arborescences = g.edge_disjoint_spanning_trees(k)
              sage: all([a.is_directed_acyclic() for a in arborescences])
              True
              sage: all([a.is_connected() for a in arborescences])
 -            True
 +            True

          In the undirected case, we can only ensure half of it::
 }}}

-- 
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9584#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 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