./sage -fixdoctests --distribution 'sagemath-graphs' --probe all --only-tags src/sage/combinat/designs/*.{py,pyx}

Author: Matthias Koeppe

src/sage/combinat/designs/database.py

@@ -107,7 +107,7 @@ def MOLS_10_2():
 
     The design is available from the general constructor::
 
-        sage: designs.orthogonal_arrays.is_available(2,10)                              # needs sage.modules
+        sage: designs.orthogonal_arrays.is_available(2,10)
         True
     """
     from sage.matrix.constructor import Matrix

src/sage/combinat/designs/designs_pyx.pyx

@@ -186,14 +186,14 @@ def is_group_divisible_design(groups,blocks,v,G=None,K=None,lambd=1,verbose=Fals
 
         sage: from sage.combinat.designs.designs_pyx import is_group_divisible_design
         sage: TD = designs.transversal_design(4,10)                                     # needs sage.modules
-        sage: groups = [list(range(i*10,(i+1)*10)) for i in range(4)]                   # needs sage.modules
+        sage: groups = [list(range(i*10,(i+1)*10)) for i in range(4)]
         sage: is_group_divisible_design(groups,TD,40,lambd=1)                           # needs sage.modules
         True
 
     TESTS::
 
         sage: TD = designs.transversal_design(4,10)                                     # needs sage.modules
-        sage: groups = [list(range(i*10,(i+1)*10)) for i in range(4)]                   # needs sage.modules
+        sage: groups = [list(range(i*10,(i+1)*10)) for i in range(4)]
         sage: is_group_divisible_design(groups, TD, 40, lambd=2, verbose=True)          # needs sage.modules
         the pair (0,10) has been seen 1 times but lambda=2
         False
@@ -366,7 +366,7 @@ def is_pairwise_balanced_design(blocks,v,K=None,lambd=1,verbose=False):
         sage: is_pairwise_balanced_design(sts,9,[3],1)
         True
         sage: TD = designs.transversal_design(4,10).blocks()                            # needs sage.modules
-        sage: groups = [list(range(i*10,(i+1)*10)) for i in range(4)]                   # needs sage.modules
+        sage: groups = [list(range(i*10,(i+1)*10)) for i in range(4)]
         sage: is_pairwise_balanced_design(TD + groups, 40, [4,10], 1, verbose=True)     # needs sage.modules
         True
 

src/sage/combinat/designs/incidence_structures.py

@@ -1238,7 +1238,7 @@ def is_berge_cyclic(self):
 
         TESTS::
 
-            sage: Hypergraph(5, [[1, 2, 3], [2, 3]]).is_berge_cyclic()                  # needs sage.modules
+            sage: Hypergraph(5, [[1, 2, 3], [2, 3]]).is_berge_cyclic()
             Traceback (most recent call last):
             ...
             TypeError: Berge cycles are defined for uniform hypergraphs only

src/sage/combinat/designs/twographs.py

@@ -218,7 +218,7 @@ def is_twograph(T):
 
     a non-regular 2-uniform hypergraph which is a two-graph::
 
-        sage: is_twograph(TwoGraph([[1,2,3],[1,2,4]]))                                  # needs sage.modules
+        sage: is_twograph(TwoGraph([[1,2,3],[1,2,4]]))
         True
 
     TESTS: