sage.combinat: More # optional

Author: Matthias Koeppe

src/sage/combinat/cluster_algebra_quiver/cluster_seed.py

@@ -1,4 +1,4 @@
-# -*- coding: utf-8 -*-
+# sage.doctest - sage.graphs sage.modules
 r"""
 ClusterSeed
 

src/sage/combinat/cluster_algebra_quiver/interact.py

@@ -25,8 +25,8 @@ def cluster_interact(self, fig_size=1, circular=True, kind='seed'):
 
     TESTS::
 
-        sage: S = ClusterSeed(['A',4])                                                  # optional - sage.graphs
-        sage: S.interact()   # indirect doctest                                         # optional - sage.graphs sage.symbolic
+        sage: S = ClusterSeed(['A',4])                                                  # optional - sage.graphs sage.modules
+        sage: S.interact()   # indirect doctest                                         # optional - sage.graphs sage.modules sage.symbolic
         ...VBox(children=...
     """
     if kind not in ['seed', 'quiver']:

src/sage/combinat/cluster_algebra_quiver/mutation_class.py

@@ -1,3 +1,4 @@
+# sage.doctest: optional - sage.graphs
 r"""
 mutation_class
 
@@ -41,11 +42,11 @@ def _principal_part(mat):
     EXAMPLES::
 
         sage: from sage.combinat.cluster_algebra_quiver.mutation_class import _principal_part
-        sage: M = Matrix([[1,2],[3,4],[5,6]]); M
+        sage: M = Matrix([[1,2],[3,4],[5,6]]); M                                        # optional - sage.modules
         [1 2]
         [3 4]
         [5 6]
-        sage: _principal_part(M)
+        sage: _principal_part(M)                                                        # optional - sage.modules
         [1 2]
         [3 4]
     """
@@ -159,7 +160,7 @@ def _matrix_to_digraph( M ):
     EXAMPLES::
 
         sage: from sage.combinat.cluster_algebra_quiver.mutation_class import _matrix_to_digraph
-        sage: _matrix_to_digraph(matrix(3,[0,1,0,-1,0,-1,0,1,0]))
+        sage: _matrix_to_digraph(matrix(3,[0,1,0,-1,0,-1,0,1,0]))                       # optional - sage.modules
         Digraph on 3 vertices
     """
     n = M.ncols()
@@ -452,7 +453,7 @@ def _dig6_to_matrix( dig6 ):
         sage: from sage.combinat.cluster_algebra_quiver.quiver import ClusterQuiver
         sage: dg = ClusterQuiver(['A',4]).digraph()
         sage: data = _digraph_to_dig6(dg)
-        sage: _dig6_to_matrix(data)
+        sage: _dig6_to_matrix(data)                                                     # optional - sage.modules
         [ 0  1  0  0]
         [-1  0 -1  0]
         [ 0  1  0  1]

src/sage/combinat/cluster_algebra_quiver/mutation_type.py

@@ -1,3 +1,4 @@
+# sage.doctest: optional - sage.graphs
 r"""
 Helper functions for mutation types of quivers
 
@@ -55,20 +56,20 @@ def is_mutation_finite(M, nr_of_checks=None):
         sage: from sage.combinat.cluster_algebra_quiver.mutation_type import is_mutation_finite
 
         sage: Q = ClusterQuiver(['A',10])
-        sage: M = Q.b_matrix()
-        sage: is_mutation_finite(M)
+        sage: M = Q.b_matrix()                                                          # optional - sage.modules
+        sage: is_mutation_finite(M)                                                     # optional - sage.modules
         (True, None)
 
         sage: Q = ClusterQuiver([(0,1),(1,2),(2,3),(3,4),(4,5),(5,6),(6,7),(7,8),(2,9)])
-        sage: M = Q.b_matrix()
-        sage: is_mutation_finite(M) # random
+        sage: M = Q.b_matrix()                                                          # optional - sage.modules
+        sage: is_mutation_finite(M)  # random                                           # optional - sage.modules
         (False, [9, 6, 9, 8, 9, 4, 0, 4, 5, 2, 1, 0, 1, 0, 7, 1, 9, 2, 5, 7, 8, 6, 3, 0, 2, 5, 4, 2, 6, 9, 2, 7, 3, 5, 3, 7, 9, 5, 9, 0, 2, 7, 9, 2, 4, 2, 1, 6, 9, 4, 3, 5, 0, 8, 2, 9, 5, 3, 7, 0, 1, 8, 3, 7, 2, 7, 3, 4, 8, 0, 4, 9, 5, 2, 8, 4, 8, 1, 7, 8, 9, 1, 5, 0, 8, 7, 4, 8, 9, 8, 0, 7, 4, 7, 1, 2, 8, 6, 1, 3, 9, 3, 9, 1, 3, 2, 4, 9, 5, 1, 2, 9, 4, 8, 5, 3, 4, 6, 8, 9, 2, 5, 9, 4, 6, 2, 1, 4, 9, 6, 0, 9, 8, 0, 4, 7, 9, 2, 1, 6])
 
     Check that :trac:`19495` is fixed::
 
-        sage: dg = DiGraph(); dg.add_vertex(0); S = ClusterSeed(dg); S
+        sage: dg = DiGraph(); dg.add_vertex(0); S = ClusterSeed(dg); S                  # optional - sage.modules
         A seed for a cluster algebra of rank 1
-        sage: S.is_mutation_finite()
+        sage: S.is_mutation_finite()                                                    # optional - sage.modules
         True
     """
     import random
@@ -1428,7 +1429,7 @@ def _random_tests(mt, k, mut_class=None, nr_mut=5):
     TESTS::
 
         sage: from sage.combinat.cluster_algebra_quiver.mutation_type import _random_tests
-        sage: _random_tests( ['A',3], 1)
+        sage: _random_tests( ['A',3], 1)                                                # optional - sage.modules
         testing ['A', 3]
     """
     from sage.combinat.cluster_algebra_quiver.quiver import ClusterQuiver

src/sage/combinat/cluster_algebra_quiver/quiver.py

@@ -1,4 +1,4 @@
-# -*- coding: utf-8 -*-
+# sage.doctest: optional - sage.graphs sage.modules
 r"""
 Quiver
 
@@ -40,7 +40,6 @@
 from sage.structure.sage_object import SageObject
 from copy import copy
 from sage.rings.integer_ring import ZZ
-from sage.rings.cc import CC
 from sage.rings.infinity import infinity
 from sage.graphs.digraph import DiGraph
 from sage.graphs.graph import Graph
@@ -67,14 +66,14 @@ class ClusterQuiver(SageObject):
 
     - ``data`` -- can be any of the following::
 
-        * QuiverMutationType
-        * str - a string representing a QuiverMutationType or a common quiver type (see Examples)
-        * ClusterQuiver
-        * Matrix - a skew-symmetrizable matrix
-        * DiGraph - must be the input data for a quiver
-        * List of edges - must be the edge list of a digraph for a quiver
+      * :class:`QuiverMutationType`
+      * :class:`str` -- a string representing a :class:`QuiverMutationType` or a common quiver type (see Examples)
+      * :class:`ClusterQuiver`
+      * :class:`Matrix` -- a skew-symmetrizable matrix
+      * :class:`DiGraph` -- must be the input data for a quiver
+      * List of edges -- must be the edge list of a digraph for a quiver
 
-    - ``frozen`` -- (default:``None``) sets the list of frozen variables
+    - ``frozen`` -- (default: ``None``) sets the list of frozen variables
       if the input type is a :class:`DiGraph`, it is ignored otherwise
 
     - ``user_labels`` -- (default:``None``) sets the names of the labels for
@@ -559,6 +558,7 @@ def plot(self, circular=True, center=(0, 0), directed=True, mark=None,
         from sage.plot.colors import rainbow
         from sage.graphs.graph_generators import GraphGenerators
         from sage.symbolic.constants import e, pi
+        from sage.rings.cc import CC
         from sage.rings.imaginary_unit import I
         graphs = GraphGenerators()
         # returns positions for graph vertices on two concentric cycles with radius 1 and 2

src/sage/combinat/cluster_algebra_quiver/quiver_mutation_type.py

@@ -1,3 +1,4 @@
+# sage.doctest: optional - sage.graphs
 r"""
 Quiver mutation types
 
@@ -326,7 +327,7 @@ def _samples(self):
 replacing all positive entries by their negatives and adding `2`'s on
 the main diagonal.
 
-``QuiverMutationType`` constructs a quiver mutation type object. For
+:class:`QuiverMutationType` constructs a quiver mutation type object. For
 more detail on the possible different types, please see the
 compendium.
 
@@ -708,7 +709,7 @@ def show(self, circular=False, directed=True):
         TESTS::
 
             sage: QMT = QuiverMutationType(['A',5])
-            sage: QMT.show() # long time
+            sage: QMT.show()  # long time                                               # optional - sage.plot sage.symbolic
         """
         self.plot(circular=circular, directed=directed).show()
 
@@ -787,7 +788,7 @@ def b_matrix(self):
 
             sage: mut_type = QuiverMutationType(['A',5]); mut_type
             ['A', 5]
-            sage: mut_type.b_matrix()
+            sage: mut_type.b_matrix()                                                   # optional - sage.plot sage.symbolic
             [ 0  1  0  0  0]
             [-1  0 -1  0  0]
             [ 0  1  0  1  0]
@@ -796,7 +797,7 @@ def b_matrix(self):
 
             sage: mut_type = QuiverMutationType(['A',3],['B',3]); mut_type
             [ ['A', 3], ['B', 3] ]
-            sage: mut_type.b_matrix()
+            sage: mut_type.b_matrix()                                                   # optional - sage.plot sage.symbolic
             [ 0  1  0  0  0  0]
             [-1  0 -1  0  0  0]
             [ 0  1  0  0  0  0]
@@ -853,7 +854,7 @@ def cartan_matrix(self):
 
             sage: mut_type = QuiverMutationType(['A',5]); mut_type
             ['A', 5]
-            sage: mut_type.cartan_matrix()
+            sage: mut_type.cartan_matrix()                                              # optional - sage.modules
             [ 2 -1  0  0  0]
             [-1  2 -1  0  0]
             [ 0 -1  2 -1  0]
@@ -862,7 +863,7 @@ def cartan_matrix(self):
 
             sage: mut_type = QuiverMutationType(['A',3],['B',3]); mut_type
             [ ['A', 3], ['B', 3] ]
-            sage: mut_type.cartan_matrix()
+            sage: mut_type.cartan_matrix()                                              # optional - sage.modules
             [ 2 -1  0  0  0  0]
             [-1  2 -1  0  0  0]
             [ 0 -1  2  0  0  0]
@@ -1105,7 +1106,7 @@ def properties(self):
 class QuiverMutationType_Irreducible(QuiverMutationType_abstract):
     """
     The mutation type for a cluster algebra or a quiver. Should not be
-    called directly, but through QuiverMutationType.
+    called directly, but through :class:`QuiverMutationType`.
     """
 
     def __init__(self, letter, rank, twist=None):
@@ -1694,7 +1695,7 @@ def class_size(self):
         which are mutation equivalent to the standard quiver of
         ``self`` (up to isomorphism) is returned.
 
-        Otherwise, ``NotImplemented`` is returned.
+        Otherwise, :obj:`NotImplemented` is returned.
 
         Formula for finite type A is taken from Torkildsen - Counting
         cluster-tilted algebras of type `A_n`.
@@ -1898,7 +1899,7 @@ def class_size(self):
 
     def dual(self):
         """
-        Return the QuiverMutationType which is dual to ``self``.
+        Return the :class:`QuiverMutationType` which is dual to ``self``.
 
         EXAMPLES::
 
@@ -1962,8 +1963,8 @@ def dual(self):
 class QuiverMutationType_Reducible(QuiverMutationType_abstract):
     """
     The mutation type for a cluster algebra or a quiver. Should not be
-    called directly, but through QuiverMutationType.  Inherits from
-    QuiverMutationType_abstract.
+    called directly, but through :class:`QuiverMutationType`.  Inherits from
+    :class:`QuiverMutationType_abstract`.
     """
 
     def __init__(self, *args):
@@ -2056,7 +2057,7 @@ def class_size(self):
         which are mutation equivalent to the standard quiver of
         ``self`` (up to isomorphism) is returned.
 
-        Otherwise, ``NotImplemented`` is returned.
+        Otherwise, :obj:`NotImplemented` is returned.
 
         EXAMPLES::
 
@@ -2095,7 +2096,7 @@ def class_size(self):
 
     def dual(self):
         """
-        Return the QuiverMutationType which is dual to ``self``.
+        Return the :class:`QuiverMutationType` which is dual to ``self``.
 
         EXAMPLES::
 
@@ -2296,7 +2297,7 @@ def save_quiver_data(n, up_to=True, types='ClassicalExceptional', verbose=True):
 
     INPUT:
 
-    - ``n``: the rank (or the upper limit on the rank) of the mutation
+    - ``n`` -- the rank (or the upper limit on the rank) of the mutation
       classes that are being saved.
 
     - ``up_to`` -- (default:``True``) if ``True``, saves data for
@@ -2437,17 +2438,17 @@ def _edge_list_to_matrix(edges, nlist, mlist) -> matrix:
 
         sage: from sage.combinat.cluster_algebra_quiver.quiver_mutation_type import _edge_list_to_matrix
         sage: G = QuiverMutationType(['A', 2])._digraph
-        sage: _edge_list_to_matrix(G.edges(sort=True), [0, 1], [])
+        sage: _edge_list_to_matrix(G.edges(sort=True), [0, 1], [])                      # optional - sage.modules
         [ 0  1]
         [-1  0]
 
         sage: G2 = DiGraph([('a', 'b', 1)])
-        sage: _edge_list_to_matrix(G2.edges(sort=True), ['a', 'b'], [])
+        sage: _edge_list_to_matrix(G2.edges(sort=True), ['a', 'b'], [])                 # optional - sage.modules
         [ 0  1]
         [-1  0]
 
         sage: G3 = DiGraph([('a', 'b', 1), ('b', 'c', 1)])
-        sage: _edge_list_to_matrix(G3.edges(sort=True), ['a', 'b'], ['c'])
+        sage: _edge_list_to_matrix(G3.edges(sort=True), ['a', 'b'], ['c'])              # optional - sage.modules
         [ 0  1]
         [-1  0]
         [ 0 -1]