use n_ in docstrings

mantepse · mantepse · commit fd41cecd9ecc · 2025-09-29T20:32:51.000+02:00
diff --git a/src/doc/en/thematic_tutorials/sandpile.rst b/src/doc/en/thematic_tutorials/sandpile.rst
@@ -4365,7 +4365,7 @@ EXAMPLES::
     {0: 2, 1: 3, 2: 1, 3: 2}
     sage: n(mean([D.simulate_threshold().deg() for _ in range(10)]))  # random
     7.10000000000000
-    sage: n(s.stationary_density()*s.num_verts())
+    sage: n(s.stationary_density()*s.n_vertices())
     6.93750000000000
 
 .. NOTE::
diff --git a/src/sage/categories/coxeter_groups.py b/src/sage/categories/coxeter_groups.py
@@ -1885,11 +1885,11 @@ def reduced_word_graph(self):
                 sage: W = WeylGroup(['A', 3], prefix='s')
                 sage: w0 = W.long_element()
                 sage: G = w0.reduced_word_graph()
-                sage: G.num_verts()
+                sage: G.n_vertices()
                 16
                 sage: len(w0.reduced_words())
                 16
-                sage: G.num_edges()
+                sage: G.n_edges()
                 18
                 sage: len([e for e in G.edges(sort=False) if e[2] == 2])
                 10
@@ -1906,9 +1906,9 @@ def reduced_word_graph(self):
                 sage: # needs sage.combinat sage.graphs sage.groups
                 sage: w1 = W.one()
                 sage: G = w1.reduced_word_graph()
-                sage: G.num_verts()
+                sage: G.n_vertices()
                 1
-                sage: G.num_edges()
+                sage: G.n_edges()
                 0
 
             .. SEEALSO::
diff --git a/src/sage/categories/semigroups.py b/src/sage/categories/semigroups.py
@@ -208,7 +208,7 @@ def cayley_graph(self, side='right', simple=False, elements=None,
                 ....:          vertex_colors={(1,1,1): G.vertices(sort=True)},
                 ....:          bgcolor=(0,0,0), color_by_label=True,
                 ....:          xres=700, yres=700, iterations=200)
-                sage: G.num_edges()
+                sage: G.n_edges()
                 120
 
                 sage: # needs sage.combinat sage.graphs sage.groups
@@ -221,7 +221,7 @@ def cayley_graph(self, side='right', simple=False, elements=None,
 
                 sage: # needs sage.graphs sage.groups
                 sage: G = A5.cayley_graph(generators=[A5.gens()[0]])
-                sage: G.num_edges()
+                sage: G.n_edges()
                 60
                 sage: g = PermutationGroup([(i + 1, j + 1)
                 ....:                       for i in range(5)
@@ -242,7 +242,7 @@ def cayley_graph(self, side='right', simple=False, elements=None,
                 ....:             for w in sum((list(Words(M.semigroup_generators(), k))
                 ....:                           for k in range(4)), [])]
                 sage: G = M.cayley_graph(elements=elements)
-                sage: G.num_verts(), G.num_edges()
+                sage: G.n_vertices(), G.n_edges()
                 (85, 84)
                 sage: G.show3d(color_by_label=True, edge_size=0.001, vertex_size=0.01)  # needs sage.plot
 
diff --git a/src/sage/combinat/constellation.py b/src/sage/combinat/constellation.py
@@ -885,9 +885,9 @@ def braid_group_orbit(self):
             g1 (0)(1,4)(2)(3)
             g2 (0,1,3,2,4)
             sage: G = c.braid_group_orbit()
-            sage: G.num_verts()
+            sage: G.n_vertices()
             4
-            sage: G.num_edges()
+            sage: G.n_edges()
             12
         """
         G = DiGraph(multiedges=True, loops=True)
diff --git a/src/sage/combinat/posets/hasse_diagram.py b/src/sage/combinat/posets/hasse_diagram.py
@@ -942,7 +942,7 @@ def cardinality(self):
             sage: H = L.hasse_diagram()
             sage: H.size()
             80
-            sage: H.size() == H.num_edges()
+            sage: H.size() == H.n_edges()
             True
         """
         return self.order()
diff --git a/src/sage/graphs/digraph.py b/src/sage/graphs/digraph.py
@@ -1611,7 +1611,7 @@ def feedback_edge_set(self, constraint_generation=True, value_only=False,
         `vu` is in the returned feedback arc set::
 
            sage: g = graphs.RandomGNP(5,.3)
-           sage: while not g.num_edges():
+           sage: while not g.n_edges():
            ....:     g = graphs.RandomGNP(5,.3)
            sage: dg = DiGraph(g)
            sage: feedback = dg.feedback_edge_set()                                      # needs sage.numerical.mip
diff --git a/src/sage/graphs/digraph_generators.py b/src/sage/graphs/digraph_generators.py
@@ -1536,9 +1536,9 @@ def RandomDirectedGN(self, n, kernel=None, seed=None, immutable=False):
 
             sage: # needs networkx
             sage: D = digraphs.RandomDirectedGN(25)
-            sage: D.num_verts()
+            sage: D.n_vertices()
             25
-            sage: D.num_edges()
+            sage: D.n_edges()
             24
             sage: D.is_connected()
             True
@@ -1618,7 +1618,7 @@ def RandomDirectedGNP(self, n, p, loops=False, seed=None, immutable=False):
         EXAMPLES::
 
             sage: D = digraphs.RandomDirectedGNP(10, .2)
-            sage: D.num_verts()
+            sage: D.n_vertices()
             10
             sage: D.parent() is DiGraph
             True
@@ -1654,15 +1654,15 @@ def RandomDirectedGNM(self, n, m, loops=False, immutable=False):
         EXAMPLES::
 
             sage: D = digraphs.RandomDirectedGNM(10, 5)
-            sage: D.num_verts()
+            sage: D.n_vertices()
             10
-            sage: D.num_edges()
+            sage: D.n_edges()
             5
 
         With loops::
 
             sage: D = digraphs.RandomDirectedGNM(10, 100, loops = True)
-            sage: D.num_verts()
+            sage: D.n_vertices()
             10
             sage: D.loops()
             [(0, 0, None), (1, 1, None), (2, 2, None), (3, 3, None),
diff --git a/src/sage/graphs/generators/families.py b/src/sage/graphs/generators/families.py
@@ -561,9 +561,9 @@ def BarbellGraph(n1, n2):
 
         sage: n1, n2 = randint(3, 10), randint(0, 10)
         sage: g = graphs.BarbellGraph(n1, n2)
-        sage: g.num_verts() == 2 * n1 + n2
+        sage: g.n_vertices() == 2 * n1 + n2
         True
-        sage: g.num_edges() == 2 * binomial(n1, 2) + n2 + 1                             # needs sage.symbolic
+        sage: g.n_edges() == 2 * binomial(n1, 2) + n2 + 1                               # needs sage.symbolic
         True
         sage: g.is_connected()
         True
@@ -638,9 +638,9 @@ def LollipopGraph(n1, n2):
 
         sage: n1, n2 = randint(3, 10), randint(0, 10)
         sage: g = graphs.LollipopGraph(n1, n2)
-        sage: g.num_verts() == n1 + n2
+        sage: g.n_vertices() == n1 + n2
         True
-        sage: g.num_edges() == binomial(n1, 2) + n2                                     # needs sage.symbolic
+        sage: g.n_edges() == binomial(n1, 2) + n2                                       # needs sage.symbolic
         True
         sage: g.is_connected()
         True
@@ -711,9 +711,9 @@ def TadpoleGraph(n1, n2):
 
         sage: n1, n2 = randint(3, 10), randint(0, 10)
         sage: g = graphs.TadpoleGraph(n1, n2)
-        sage: g.num_verts() == n1 + n2
+        sage: g.n_vertices() == n1 + n2
         True
-        sage: g.num_edges() == n1 + n2
+        sage: g.n_edges() == n1 + n2
         True
         sage: g.girth() == n1
         True
@@ -761,10 +761,10 @@ def AztecDiamondGraph(n):
         sage: graphs.AztecDiamondGraph(2)
         Aztec Diamond graph of order 2
 
-        sage: [graphs.AztecDiamondGraph(i).num_verts() for i in range(8)]
+        sage: [graphs.AztecDiamondGraph(i).n_vertices() for i in range(8)]
         [0, 4, 12, 24, 40, 60, 84, 112]
 
-        sage: [graphs.AztecDiamondGraph(i).num_edges() for i in range(8)]
+        sage: [graphs.AztecDiamondGraph(i).n_edges() for i in range(8)]
         [0, 4, 16, 36, 64, 100, 144, 196]
 
         sage: G = graphs.AztecDiamondGraph(3)
@@ -803,9 +803,9 @@ def DipoleGraph(n):
 
         sage: n = randint(0, 10)
         sage: g = graphs.DipoleGraph(n)
-        sage: g.num_verts() == 2
+        sage: g.n_vertices() == 2
         True
-        sage: g.num_edges() == n
+        sage: g.n_edges() == n
         True
         sage: g.is_connected() == (n > 0)
         True
@@ -2660,7 +2660,7 @@ def HanoiTowerGraph(pegs, disks, labels=True, positions=True):
     A slightly larger instance. ::
 
         sage: H = graphs.HanoiTowerGraph(4, 6, labels=False, positions=False)
-        sage: H.num_verts()
+        sage: H.n_vertices()
         4096
         sage: H.distance(0, 4^6-1)
         17
diff --git a/src/sage/graphs/generators/smallgraphs.py b/src/sage/graphs/generators/smallgraphs.py
@@ -3285,7 +3285,7 @@ def HoffmanSingletonGraph():
         5
         sage: HS.diameter()
         2
-        sage: HS.num_verts()
+        sage: HS.n_vertices()
         50
 
     Note that you get a different layout each time you create the graph.  ::
diff --git a/src/sage/graphs/generators/trees.pyx b/src/sage/graphs/generators/trees.pyx
@@ -306,7 +306,7 @@ def RandomLobster(n, p, q, seed=None):
         sage: G.delete_vertices(leaves)                                 # path
         sage: s = G.degree_sequence()
         sage: if G:
-        ....:     if G.num_verts() == 1:
+        ....:     if G.n_vertices() == 1:
         ....:         assert s == [0]
         ....:     else:
         ....:         assert s[-2:] == [1, 1]
@@ -511,7 +511,7 @@ cdef class TreeIterator:
         ....:     for t in TreeIterator(n):
         ....:         if not t.is_tree():
         ....:             return False
-        ....:         if t.num_verts() != n:
+        ....:         if t.n_vertices() != n:
         ....:             return False
         ....:         if t.num_edges() != n - 1:
         ....:             return False
diff --git a/src/sage/graphs/generic_graph.py b/src/sage/graphs/generic_graph.py
@@ -870,7 +870,7 @@ def _bit_vector(self):
             '101001100110000010000001001000010110000010110'
             sage: len([a for a in G._bit_vector() if a == '1'])
             15
-            sage: G.num_edges()
+            sage: G.n_edges()
             15
 
         TESTS:
@@ -7021,35 +7021,35 @@ def n_faces(self, embedding=None):
         EXAMPLES::
 
             sage: T = graphs.TetrahedralGraph()
-            sage: T.num_faces()
+            sage: T.n_faces()
             4
 
         The external face of a disconnected graph is counted only once::
 
-            sage: (T + T).num_faces()
+            sage: (T + T).n_faces()
             7
-            sage: (T + T + T).num_faces()
+            sage: (T + T + T).n_faces()
             10
 
         Trees and forests have a single face::
 
             sage: T = graphs.RandomTree(10)
-            sage: T.num_faces()
+            sage: T.n_faces()
             1
-            sage: (T + T).num_faces()
+            sage: (T + T).n_faces()
             1
 
         TESTS::
 
             sage: G = graphs.CompleteBipartiteGraph(3, 3)
-            sage: G.num_faces()
+            sage: G.n_faces()
             Traceback (most recent call last):
             ...
             ValueError: no embedding is provided and the graph is not planar
 
         Issue :issue:`22003` is fixed::
 
-            sage: Graph(1).num_faces()
+            sage: Graph(1).n_faces()
             1
         """
         if not self:
@@ -13297,10 +13297,10 @@ def set_edge_label(self, u, v, l):
         ::
 
             sage: G = Graph({0: {1: 1}}, sparse=True)
-            sage: G.num_edges()
+            sage: G.n_edges()
             1
             sage: G.set_edge_label(0, 1, 1)
-            sage: G.num_edges()
+            sage: G.n_edges()
             1
         """
         if self.allows_multiple_edges():
@@ -20260,7 +20260,7 @@ def cartesian_product(self, other, immutable=None):
              ((1, 'ab'), (1, 'ba')), ((1, 'ab'), (1, 'bb')),
              ((1, 'ba'), (1, 'aa')), ((1, 'ba'), (1, 'ab')),
              ((1, 'bb'), (1, 'ba')), ((1, 'bb'), (1, 'bb'))]
-            sage: Q.strongly_connected_components_digraph().num_verts()                 # needs sage.combinat
+            sage: Q.strongly_connected_components_digraph().n_vertices()                # needs sage.combinat
             2
             sage: V = Q.strongly_connected_component_containing_vertex((0, 'aa'))       # needs sage.combinat
             sage: B.is_isomorphic(Q.subgraph(V))                                        # needs sage.combinat
@@ -26383,7 +26383,7 @@ def symmetric_edge_polytope(self, backend=None):
 
             sage: n = randint(5, 12)
             sage: G = Graph()
-            sage: while not G.num_edges():                                              # needs networkx
+            sage: while not G.n_edges():                                                # needs networkx
             ....:     G = graphs.RandomGNP(n, 0.2)
             sage: P = G.symmetric_edge_polytope()                                       # needs networkx sage.geometry.polyhedron
             sage: P.ambient_dim() == n                                                  # needs networkx sage.geometry.polyhedron
diff --git a/src/sage/graphs/graph.py b/src/sage/graphs/graph.py
@@ -968,9 +968,9 @@ def __init__(self, data=None, pos=None, loops=None, format=None,
         Loops are not counted as multiedges (see :issue:`11693`) and edges are
         not counted twice ::
 
-            sage: Graph({1:[1]}).num_edges()
+            sage: Graph({1:[1]}).n_edges()
             1
-            sage: Graph({1:[2,2]}).num_edges()
+            sage: Graph({1:[2,2]}).n_edges()
             2
 
         An empty list or dictionary defines a simple graph
@@ -5363,7 +5363,7 @@ def distance_graph(self, dist):
 
             sage: G = graphs.OddGraph(4)
             sage: d = G.diameter()
-            sage: n = G.num_verts()
+            sage: n = G.n_vertices()
             sage: H = G.distance_graph(list(range(d+1)))
             sage: H.is_isomorphic(graphs.CompleteGraph(n))
             False
@@ -5418,10 +5418,10 @@ def distance_graph(self, dist):
         Empty input, or unachievable distances silently yield empty graphs::
 
             sage: G = graphs.CompleteGraph(5)
-            sage: G.distance_graph([]).num_edges()
+            sage: G.distance_graph([]).n_edges()
             0
             sage: G = graphs.CompleteGraph(5)
-            sage: G.distance_graph(23).num_edges()
+            sage: G.distance_graph(23).n_edges()
             0
 
         It is an error to provide a distance that is not an integer type::
diff --git a/src/sage/graphs/graph_generators_pyx.pyx b/src/sage/graphs/graph_generators_pyx.pyx
@@ -52,7 +52,7 @@ def RandomGNP(n, p, bint directed=False, bint loops=False, seed=None,
 
         sage: from sage.graphs.graph_generators_pyx import RandomGNP
         sage: D = RandomGNP(10, .2, directed=True, seed=0)
-        sage: D.num_verts()
+        sage: D.n_vertices()
         10
         sage: D.edges(sort=True, labels=False)
         [(0, 3), (0, 6), (1, 7), (1, 9), (4, 6), (4, 7), (5, 4), (5, 6),
diff --git a/src/sage/groups/perm_gps/partn_ref/refinement_graphs.pyx b/src/sage/groups/perm_gps/partn_ref/refinement_graphs.pyx
@@ -362,18 +362,18 @@ def search_tree(G_in, partition, lab=True, dig=False, dict_rep=False, certificat
     Certain border cases need to be tested as well::
 
         sage: G = Graph('Fll^G')
-        sage: a,b,c = st(G, [range(G.num_verts())], order=True); b
+        sage: a,b,c = st(G, [range(G.n_vertices())], order=True); b
         Graph on 7 vertices
         sage: c
         48
         sage: G = Graph(21)
-        sage: st(G, [range(G.num_verts())], order=True)[2] == factorial(21)
+        sage: st(G, [range(G.n_vertices())], order=True)[2] == factorial(21)
         True
 
         sage: G = Graph('^????????????????????{??N??@w??FaGa?PCO@CP?AGa?_QO?Q@G?CcA??cc????Bo????{????F_')
         sage: perm = {3:15, 15:3}
         sage: H = G.relabel(perm, inplace=False)
-        sage: st(G, [range(G.num_verts())])[1] == st(H, [range(H.num_verts())])[1]
+        sage: st(G, [range(G.n_vertices())])[1] == st(H, [range(H.n_vertices())])[1]
         True
 
         sage: st(Graph(':Dkw'), [range(5)], lab=False, dig=True)
diff --git a/src/sage/matroids/graphic_matroid.pyx b/src/sage/matroids/graphic_matroid.pyx
diff --git a/src/sage/sandpiles/sandpile.py b/src/sage/sandpiles/sandpile.py

Original file line number	Diff line number	Diff line change
`@@ -1885,11 +1885,11 @@ def reduced_word_graph(self):`
`1885`	`1885`	`sage: W = WeylGroup(['A', 3], prefix='s')`
`1886`	`1886`	`sage: w0 = W.long_element()`
`1887`	`1887`	`sage: G = w0.reduced_word_graph()`
`1888`		`- sage: G.num_verts()`
	`1888`	`+ sage: G.n_vertices()`
`1889`	`1889`	`16`
`1890`	`1890`	`sage: len(w0.reduced_words())`
`1891`	`1891`	`16`
`1892`		`- sage: G.num_edges()`
	`1892`	`+ sage: G.n_edges()`
`1893`	`1893`	`18`
`1894`	`1894`	`sage: len([e for e in G.edges(sort=False) if e[2] == 2])`
`1895`	`1895`	`10`
`@@ -1906,9 +1906,9 @@ def reduced_word_graph(self):`
`1906`	`1906`	`sage: # needs sage.combinat sage.graphs sage.groups`
`1907`	`1907`	`sage: w1 = W.one()`
`1908`	`1908`	`sage: G = w1.reduced_word_graph()`
`1909`		`- sage: G.num_verts()`
	`1909`	`+ sage: G.n_vertices()`
`1910`	`1910`	`1`
`1911`		`- sage: G.num_edges()`
	`1911`	`+ sage: G.n_edges()`
`1912`	`1912`	`0`
`1913`	`1913`
`1914`	`1914`	`.. SEEALSO::`
Original file line number	Diff line number	Diff line change
`@@ -885,9 +885,9 @@ def braid_group_orbit(self):`
`885`	`885`	`g1 (0)(1,4)(2)(3)`
`886`	`886`	`g2 (0,1,3,2,4)`
`887`	`887`	`sage: G = c.braid_group_orbit()`
`888`		`- sage: G.num_verts()`
	`888`	`+ sage: G.n_vertices()`
`889`	`889`	`4`
`890`		`- sage: G.num_edges()`
	`890`	`+ sage: G.n_edges()`
`891`	`891`	`12`
`892`	`892`	`"""`
`893`	`893`	`G = DiGraph(multiedges=True, loops=True)`
Original file line number	Diff line number	Diff line change
`@@ -942,7 +942,7 @@ def cardinality(self):`
`942`	`942`	`sage: H = L.hasse_diagram()`
`943`	`943`	`sage: H.size()`
`944`	`944`	`80`
`945`		`- sage: H.size() == H.num_edges()`
	`945`	`+ sage: H.size() == H.n_edges()`
`946`	`946`	`True`
`947`	`947`	`"""`
`948`	`948`	`return self.order()`
Original file line number	Diff line number	Diff line change
`@@ -1536,9 +1536,9 @@ def RandomDirectedGN(self, n, kernel=None, seed=None, immutable=False):`
`1536`	`1536`
`1537`	`1537`	`sage: # needs networkx`
`1538`	`1538`	`sage: D = digraphs.RandomDirectedGN(25)`
`1539`		`- sage: D.num_verts()`
	`1539`	`+ sage: D.n_vertices()`
`1540`	`1540`	`25`
`1541`		`- sage: D.num_edges()`
	`1541`	`+ sage: D.n_edges()`
`1542`	`1542`	`24`
`1543`	`1543`	`sage: D.is_connected()`
`1544`	`1544`	`True`
`@@ -1618,7 +1618,7 @@ def RandomDirectedGNP(self, n, p, loops=False, seed=None, immutable=False):`
`1618`	`1618`	`EXAMPLES::`
`1619`	`1619`
`1620`	`1620`	`sage: D = digraphs.RandomDirectedGNP(10, .2)`
`1621`		`- sage: D.num_verts()`
	`1621`	`+ sage: D.n_vertices()`
`1622`	`1622`	`10`
`1623`	`1623`	`sage: D.parent() is DiGraph`
`1624`	`1624`	`True`
`@@ -1654,15 +1654,15 @@ def RandomDirectedGNM(self, n, m, loops=False, immutable=False):`
`1654`	`1654`	`EXAMPLES::`
`1655`	`1655`
`1656`	`1656`	`sage: D = digraphs.RandomDirectedGNM(10, 5)`
`1657`		`- sage: D.num_verts()`
	`1657`	`+ sage: D.n_vertices()`
`1658`	`1658`	`10`
`1659`		`- sage: D.num_edges()`
	`1659`	`+ sage: D.n_edges()`
`1660`	`1660`	`5`
`1661`	`1661`
`1662`	`1662`	`With loops::`
`1663`	`1663`
`1664`	`1664`	`sage: D = digraphs.RandomDirectedGNM(10, 100, loops = True)`
`1665`		`- sage: D.num_verts()`
	`1665`	`+ sage: D.n_vertices()`
`1666`	`1666`	`10`
`1667`	`1667`	`sage: D.loops()`
`1668`	`1668`	`[(0, 0, None), (1, 1, None), (2, 2, None), (3, 3, None),`
Original file line number	Diff line number	Diff line change
`@@ -3285,7 +3285,7 @@ def HoffmanSingletonGraph():`
`3285`	`3285`	`5`
`3286`	`3286`	`sage: HS.diameter()`
`3287`	`3287`	`2`
`3288`		`- sage: HS.num_verts()`
	`3288`	`+ sage: HS.n_vertices()`
`3289`	`3289`	`50`
`3290`	`3290`
`3291`	`3291`	`Note that you get a different layout each time you create the graph. ::`