More # optional

Author: Matthias Koeppe

src/sage/geometry/lattice_polytope.py

@@ -2988,15 +2988,15 @@ def normal_form(self, algorithm="palp", permutation=False):
         We can perform the same examples using other algorithms::
 
             sage: o = lattice_polytope.cross_polytope(2)
-            sage: o.normal_form(algorithm="palp_native")
+            sage: o.normal_form(algorithm="palp_native")                                # optional - sage.groups
             M( 1,  0),
             M( 0,  1),
             M( 0, -1),
             M(-1,  0)
             in 2-d lattice M
 
             sage: o = lattice_polytope.cross_polytope(2)
-            sage: o.normal_form(algorithm="palp_modified")
+            sage: o.normal_form(algorithm="palp_modified")                              # optional - sage.groups
             M( 1,  0),
             M( 0,  1),
             M( 0, -1),
@@ -3054,13 +3054,13 @@ def _palp_modified_normal_form(self, permutation=False):
             M(-1,  0),
             M( 0, -1)
             in 2-d lattice M
-            sage: o._palp_modified_normal_form()                                        # optional - sage.graphs
+            sage: o._palp_modified_normal_form()                                        # optional - sage.graphs sage.groups
             M( 1,  0),
             M( 0,  1),
             M( 0, -1),
             M(-1,  0)
             in 2-d lattice M
-            sage: o._palp_modified_normal_form(permutation=True)                        # optional - sage.graphs
+            sage: o._palp_modified_normal_form(permutation=True)                        # optional - sage.graphs sage.groups
             (M( 1,  0),
             M( 0,  1),
             M( 0, -1),
@@ -3159,7 +3159,7 @@ def _palp_PM_max(self, check=False):
             sage: o = lattice_polytope.cross_polytope(2)
             sage: PM = o.vertex_facet_pairing_matrix()
             sage: PM_max = PM.permutation_normal_form()                                 # optional - sage.graphs
-            sage: PM_max == o._palp_PM_max()                                            # optional - sage.graphs
+            sage: PM_max == o._palp_PM_max()                                            # optional - sage.graphs sage.groups
             True
             sage: P2 = ReflexivePolytope(2, 0)
             sage: PM_max, permutations = P2._palp_PM_max(check=True)

src/sage/geometry/polyhedron/base.py

@@ -124,8 +124,8 @@ class Polyhedron_base(Polyhedron_base7):
 
     ::
 
-        sage: p = polytopes.flow_polytope(digraphs.DeBruijn(3,2))                       # optional - sage.graphs
-        sage: TestSuite(p).run()                                                        # optional - sage.graphs
+        sage: p = polytopes.flow_polytope(digraphs.DeBruijn(3,2))                       # optional - sage.combinat sage.graphs
+        sage: TestSuite(p).run()                                                        # optional - sage.combinat sage.graphs
 
     ::
 
@@ -264,10 +264,10 @@ def to_linear_program(self, solver=None, return_variable=False, base_ring=None):
 
         TESTS::
 
-            sage: p = polytopes.flow_polytope(digraphs.DeBruijn(3,2)); p                # optional - sage.graphs
+            sage: p = polytopes.flow_polytope(digraphs.DeBruijn(3,2)); p                # optional - sage.combinat sage.graphs
             A 19-dimensional polyhedron in QQ^27
              defined as the convex hull of 1 vertex and 148 rays
-            sage: p.to_linear_program().polyhedron() == p                               # optional - sage.graphs
+            sage: p.to_linear_program().polyhedron() == p                               # optional - sage.combinat sage.graphs
             True
 
             sage: p = polytopes.icosahedron()                                           # optional - sage.rings.number_field