provide aliases n_vertices, n_edges, n_faces

Author: mantepse

src/sage/graphs/generic_graph.py

@@ -4803,8 +4803,8 @@ def order(self):
         """
         Return the number of vertices.
 
-        Note that ``len(G)`` and :meth:`num_verts` also return the number of
-        vertices in `G`.
+        Note that ``len(G)`` and :meth:`n_vertices` also return the
+        number of vertices in `G`.
 
         EXAMPLES::
 
@@ -4817,29 +4817,35 @@ def order(self):
             sage: G = graphs.TetrahedralGraph()
             sage: len(G)
             4
+
         """
         return self._backend.num_verts()
 
     __len__ = order
 
     num_verts = order
 
+    n_vertices = order
+
     def size(self):
         """
         Return the number of edges.
 
-        Note that :meth:`num_edges` also returns the number of edges in `G`.
+        Note that :meth:`n_edges` also returns the number of edges in `G`.
 
         EXAMPLES::
 
             sage: G = graphs.PetersenGraph()
             sage: G.size()
             15
+
         """
         return self._backend.num_edges(self._directed)
 
     num_edges = size
 
+    n_edges = size
+
     def eulerian_circuit(self, return_vertices=False, labels=True, path=False):
         r"""
         Return a list of edges forming an Eulerian circuit if one exists.
@@ -6987,7 +6993,7 @@ def faces(self, embedding=None):
             faces.append(path)
         return faces
 
-    def num_faces(self, embedding=None):
+    def n_faces(self, embedding=None):
         """
         Return the number of faces of an embedded graph.
 
@@ -7074,6 +7080,8 @@ def num_faces(self, embedding=None):
             F += g.num_faces(emb) - 1
         return F
 
+    num_faces = n_faces
+
     def planar_dual(self, embedding=None):
         """
         Return the planar dual of an embedded graph.