replace some leftovers

Author: mantepse

src/sage/graphs/bliss.pyx

@@ -476,7 +476,7 @@ cpdef canonical_form(G, partition=None, return_graph=False,
         ....:     for labels in product([0,1], repeat=len(edges)):
         ....:         g = Graph([(u,v,l) for ((u,v),l) in zip(edges, labels)])
         ....:         gcan = canonical_form(g, use_edge_labels=True)
-        ....:         for p in permutations(range(g.num_verts())):
+        ....:         for p in permutations(range(g.n_vertices())):
         ....:             h = Graph([(p[u], p[v], lab) for u,v,lab in g.edges(sort=True)])
         ....:             hcan = canonical_form(h, use_edge_labels=True)
         ....:             if gcan != hcan: print(edges, labels, p)

src/sage/graphs/generators/trees.pyx

@@ -513,7 +513,7 @@ cdef class TreeIterator:
         ....:             return False
         ....:         if t.n_vertices() != n:
         ....:             return False
-        ....:         if t.num_edges() != n - 1:
+        ....:         if t.n_edges() != n - 1:
         ....:             return False
         ....:         for tree in trees:
         ....:             if tree.is_isomorphic(t):

src/sage/graphs/graph_generators.py

@@ -798,7 +798,7 @@ def __call__(self, vertices=None, property=None, augment='edges', size=None,
         ::
 
             sage: for g in graphs():
-            ....:    if g.num_verts() > 3: break
+            ....:    if g.n_vertices() > 3: break
             ....:    print(g)
             Graph on 0 vertices
             Graph on 1 vertex