passagemath-graphs 10.5.10__cp39-cp39-macosx_14_0_arm64.whl → 10.5.43__cp39-cp39-macosx_14_0_arm64.whl

sage/graphs/generators/distance_regular.pyx

@@ -1202,10 +1202,10 @@ def is_from_GQ_spread(list arr):
 
          sage: from sage.graphs.generators.distance_regular import \
          ....: is_from_GQ_spread, graph_from_GQ_spread
-         sage: is_from_GQ_spread([125, 120, 1, 1, 24, 125])                             # needs sage.libs.pari
+         sage: is_from_GQ_spread([125, 120, 1, 1, 24, 125])                             # needs sage.libs.flint sage.libs.pari
          (5, 25)
-         sage: G = graph_from_GQ_spread(5, 25)                                          # needs sage.libs.pari
-         sage: G.is_distance_regular(True)                                              # needs sage.libs.pari
+         sage: G = graph_from_GQ_spread(5, 25)                                          # needs sage.libs.flint sage.libs.pari
+         sage: G.is_distance_regular(True)                                              # needs sage.libs.flint sage.libs.pari
          ([125, 120, 1, None], [None, 1, 24, 125])
 
     REFERENCES:
@@ -1217,9 +1217,9 @@ def is_from_GQ_spread(list arr):
 
          sage: from sage.graphs.generators.distance_regular import \
          ....: is_from_GQ_spread
-         sage: is_from_GQ_spread([343, 336, 1, 1, 48, 343])                             # needs sage.libs.pari
+         sage: is_from_GQ_spread([343, 336, 1, 1, 48, 343])                             # needs sage.libs.flint sage.libs.pari
          (7, 49)
-         sage: is_from_GQ_spread([343, 336, 1, 2, 48, 343])                             # needs sage.libs.pari
+         sage: is_from_GQ_spread([343, 336, 1, 2, 48, 343])                             # needs sage.libs.flint sage.libs.pari
          False
 
     Check that we don't get ``True`` for inexisting GQs::
@@ -1230,7 +1230,7 @@ def is_from_GQ_spread(list arr):
          sage: t = 6
          sage: [s * t, s * (t-1), 1, 1, t - 1, s * t]
          [30, 25, 1, 1, 5, 30]
-         sage: is_from_GQ_spread([30, 25, 1, 1, 5, 30])                                 # needs sage.libs.pari
+         sage: is_from_GQ_spread([30, 25, 1, 1, 5, 30])                                 # needs sage.libs.flint sage.libs.pari
          False
     """
     from sage.combinat.designs import design_catalog as designs
@@ -1273,8 +1273,8 @@ def graph_from_GQ_spread(const int s, const int t):
 
          sage: from sage.graphs.generators.distance_regular import \
          ....: graph_from_GQ_spread
-         sage: G = graph_from_GQ_spread(4, 16)                                          # needs sage.libs.pari
-         sage: G.is_distance_regular(True)                                              # needs sage.libs.pari
+         sage: G = graph_from_GQ_spread(4, 16)                                          # needs sage.libs.flint sage.libs.pari
+         sage: G.is_distance_regular(True)                                              # needs sage.libs.flint sage.libs.pari
          ([64, 60, 1, None], [None, 1, 15, 64])
 
     REFERENCES:
@@ -1285,11 +1285,11 @@ def graph_from_GQ_spread(const int s, const int t):
 
          sage: from sage.graphs.generators.distance_regular import \
          ....: graph_from_GQ_spread, is_from_GQ_spread
-         sage: is_from_GQ_spread([64, 60, 1, 1, 15, 64])                                # needs sage.libs.pari
+         sage: is_from_GQ_spread([64, 60, 1, 1, 15, 64])                                # needs sage.libs.flint sage.libs.pari
          (4, 16)
-         sage: graph_from_GQ_spread(*is_from_GQ_spread([27, 24, 1, 1, 8, 27]))          # needs sage.libs.pari
+         sage: graph_from_GQ_spread(*is_from_GQ_spread([27, 24, 1, 1, 8, 27]))          # needs sage.libs.flint sage.libs.pari
          Graph on 112 vertices
-         sage: _.is_distance_regular(True)                                              # needs sage.libs.pari
+         sage: _.is_distance_regular(True)                                              # needs sage.libs.flint sage.libs.pari
          ([27, 24, 1, None], [None, 1, 8, 27])
     """
     from sage.combinat.designs import design_catalog as designs
@@ -2746,7 +2746,7 @@ def distance_regular_graph(list arr, existence=False, check=True):
         Graph on 1024 vertices
         sage: graphs.distance_regular_graph([6,5,5,5,1,1,1,6])  # optional - database_graphs
         Generalised octagon of order (1, 5): Graph on 312 vertices
-        sage: graphs.distance_regular_graph([64, 60, 1, 1, 15, 64], check=True)
+        sage: graphs.distance_regular_graph([64, 60, 1, 1, 15, 64], check=True)         # needs sage.libs.gap
         Graph on 325 vertices
     """
     from sage.misc.unknown import Unknown

sage/graphs/generators/families.py

@@ -3919,9 +3919,9 @@ def MathonPseudocyclicStronglyRegularGraph(t, G=None, L=None):
     Using default ``G`` and ``L``. ::
 
         sage: from sage.graphs.generators.families import MathonPseudocyclicStronglyRegularGraph
-        sage: G = MathonPseudocyclicStronglyRegularGraph(1); G                          # needs sage.modules sage.rings.finite_rings
+        sage: G = MathonPseudocyclicStronglyRegularGraph(1); G                          # needs database_graphs sage.modules sage.rings.finite_rings
         Mathon's PC SRG on 45 vertices: Graph on 45 vertices
-        sage: G.is_strongly_regular(parameters=True)                                    # needs sage.modules sage.rings.finite_rings
+        sage: G.is_strongly_regular(parameters=True)                                    # needs database_graphs sage.modules sage.rings.finite_rings
         (45, 22, 10, 11)
 
     Supplying ``G`` and ``L`` (constructed from the automorphism group

sage/graphs/generators/random.py

@@ -1710,7 +1710,7 @@ def RandomKTree(n, k, seed=None):
 
     # A graph with treewidth 0 has no edges
     if k == 0:
-        g = Graph(n, name=f"Random 0-tree")
+        g = Graph(n, name="Random 0-tree")
         return g
 
     if n < k + 1:
@@ -1804,7 +1804,7 @@ def RandomPartialKTree(n, k, x, seed=None):
 
     # A graph with treewidth 0 has no edges
     if k == 0:
-        g = Graph(n, name=f"Random partial 0-tree")
+        g = Graph(n, name="Random partial 0-tree")
         return g
 
     if n < k + 1:
@@ -2322,21 +2322,16 @@ def RandomTriangulation(n, set_position=False, k=3, seed=None):
 
     pattern = ['in', 'in', 'in', 'lf', 'in']  # 'partial closures'
 
-    def rotate_word_to_next_occurrence(word):
-        """
-        Rotate ``word`` so that the given pattern occurs at the beginning.
-
-        If the given pattern is not found, return the empty list.
-        """
+    # We greedily perform the replacements 'in1,in2,in3,lf,in3'->'in1,in3'.
+    while True:
+        # first we rotate the word to it starts with pattern
+        word2 = []
         N = len(word)
         for i in range(N):
             if all(word[(i + j) % N][0] == pattern[j] for j in range(5)):
-                return word[i:] + word[:i]
-        return []
+                word2 = word[i:] + word[:i]
+                break
 
-    # We greedily perform the replacements 'in1,in2,in3,lf,in3'->'in1,in3'.
-    while True:
-        word2 = rotate_word_to_next_occurrence(word)
         if len(word2) >= 5:
             word = [word2[0]] + word2[4:]
             in1, in2, in3 = (u[1] for u in word2[:3])

sage/graphs/generators/smallgraphs.py

@@ -1376,7 +1376,7 @@ def BrouwerHaemersGraph():
 
     Its has as eigenvalues `20,2` and `-7`::
 
-        sage: set(g.spectrum()) == {20,2,-7}                                            # needs sage.modules sage.rings.finite_rings
+        sage: set(g.spectrum()) == {20,2,-7}                                            # needs sage.modules sage.rings.finite_rings sage.rings.number_field
         True
     """
     from sage.rings.finite_rings.finite_field_constructor import FiniteField
@@ -4038,14 +4038,14 @@ def MurtyGraph():
     - Janmenjaya Panda (2024-08-03)
     """
     pos_dict = {
-        0: (-0.5, sqrt(3)/2),
-        1: (0.5, sqrt(3)/2),
-        2: (-1, 0),
-        3: (0, 0),
-        4: (1, 0),
-        5: (-0.5, -1 - sqrt(3)/2),
-        6: (0, -1),
-        7: (0.5, -1 - sqrt(3)/2)
+        0: (-0.5, sqrt(3.0)/2.0),
+        1: (0.5, sqrt(3.0)/2.0),
+        2: (-1.0, 0.0),
+        3: (0.0, 0.0),
+        4: (1.0, 0.0),
+        5: (-0.5, -1.0 - sqrt(3.0)/2.0),
+        6: (0.0, -1.0),
+        7: (0.5, -1.0 - sqrt(3.0)/2.0)
     }
 
     G = Graph(8, pos=pos_dict, name="Murty Graph")
@@ -4624,7 +4624,7 @@ def TricornGraph():
 
     The Tricorn graph is obtained by splicing a complete graph `K_4` with the
     the triangular circular ladder graph `\overline{C_6}`. (Note that this
-    generates a unqiue graph as both of the graphs `K_4` and `\overline{C_6}`
+    generates a unique graph as both of the graphs `K_4` and `\overline{C_6}`
     are vertex-transitive). It is a nonsolid brick. This matching covered graph
     is one of the ten extremal cubic bricks. (A matching covered graph `G` is
     *extremal* if `\Phi(G) = dim(\mathcal{Lin}(G))`, where `\Phi(G)` denotes
@@ -4664,6 +4664,7 @@ def TricornGraph():
     `(5, 6)` and `(8, 9)` are the only removable edges of the Tricorn
     graph::
 
+        sage: # needs sage.symbolic
         sage: g = graphs.TricornGraph()
         sage: g.name()
         'Tricorn Graph'
@@ -5573,7 +5574,7 @@ def IoninKharaghani765Graph():
 
     TESTS::
 
-        sage: graphs.strongly_regular_graph(765, 192, 48, 48)                           # needs sage.modules sage.rings.finite_rings
+        sage: graphs.strongly_regular_graph(765, 192, 48, 48)                           # needs database_graphs sage.modules sage.rings.finite_rings
         Ionin-Kharaghani: Graph on 765 vertices
 
     .. TODO::