Trac #34952: sage.graphs: Replace imports from sage.*.all for namespace packages

Using `./sage -fiximports` from #34945.

Also remove trailing whitespace in the affected files.

Part of Meta-ticket #32414

URL: https://trac.sagemath.org/34952
Reported by: mkoeppe
Ticket author(s): Alex Chandler
Reviewer(s): David Coudert

Author: Release Manager

src/sage/graphs/digraph.py

@@ -3472,7 +3472,7 @@ def period(self):
 
             :meth:`is_aperiodic`
         """
-        from sage.arith.all import gcd
+        from sage.arith.misc import GCD as gcd
 
         g = 0
 

src/sage/graphs/digraph_generators.py

@@ -393,7 +393,7 @@ def Paley(self, q):
         """
         from sage.rings.finite_rings.integer_mod import mod
         from sage.rings.finite_rings.finite_field_constructor import FiniteField
-        from sage.arith.all import is_prime_power
+        from sage.arith.misc import is_prime_power
         if not is_prime_power(q):
             raise ValueError("parameter q must be a prime power")
         if not mod(q, 4) == 3:

src/sage/graphs/edge_connectivity.pyx

@@ -61,14 +61,14 @@ cdef class GabowEdgeConnectivity:
         ....:     D = DiGraph(graphs.RandomRegular(6, 50))
         sage: GabowEdgeConnectivity(D).edge_connectivity()
         6
-    
+
     A complete digraph with `n` vertices is `n-1`-edge-connected::
 
         sage: from sage.graphs.edge_connectivity import GabowEdgeConnectivity
         sage: D = DiGraph(digraphs.Complete(10))
         sage: GabowEdgeConnectivity(D, use_rec = True).edge_connectivity()
         9
-    
+
     Check that we get the same result when with and without the DFS-based
     speed-up initialization proposed in [GKLP2021]_::
 
@@ -79,7 +79,7 @@ cdef class GabowEdgeConnectivity:
         sage: ec3 = GabowEdgeConnectivity(D, dfs_preprocessing=True, use_rec=True).edge_connectivity()
         sage: ec1 == ec2 and ec2 == ec3
         True
-        
+
     TESTS:
 
     :trac:`32169`::
@@ -158,9 +158,9 @@ cdef class GabowEdgeConnectivity:
     cdef int augmenting_root
     cdef bint* tree_flag  # indicate whether a tree Ti has been touched
     cdef int* root  # current root vertex of f_tree i
-    cdef int* L_roots  # L_roots of the trees 
+    cdef int* L_roots  # L_roots of the trees
     cdef bint* forests  # indicate whether the f_tree is active or inactive
-    cdef bint** labeled  # 
+    cdef bint** labeled  #
 
     cdef int** parent_1  # parent of v in tree/forest Ti
     cdef int** parent_2  # parent of v in tree/forest Ti
@@ -176,7 +176,7 @@ cdef class GabowEdgeConnectivity:
     cdef vector[int] A_path
     cdef vector[int] left_traverse
     cdef vector[int] right_traverse
-    
+
     cdef bint* seen  # for method re_init
     cdef int* stack  # stack of vertices for DFS in re_init
     cdef vector[vector[int]] tree_edges  # used to organise the edges of the trees
@@ -243,7 +243,7 @@ cdef class GabowEdgeConnectivity:
         self.n = G.order()
         self.m = G.size()
         self.mem = MemoryAllocator()
-        
+
         # Build compact graph data structure with out and in adjacencies.
         # Loops are removed from the graph.
         self.build_graph_data_structure()
@@ -420,7 +420,7 @@ cdef class GabowEdgeConnectivity:
         if self.dfs_preprocessing and self.num_start_f_trees < self.n - 1:
             self.re_init(tree)
 
-        # There are n f-trees, and we try to join them 
+        # There are n f-trees, and we try to join them
         while njoins < self.num_start_f_trees-1:
             # Get the root of an active subtree or INT_MAX if none exists
             z = self.choose_root()
@@ -469,7 +469,7 @@ cdef class GabowEdgeConnectivity:
             self.my_depth[tree] = <int*>self.mem.calloc(self.n, sizeof(int))
         if not self.my_parent_edge_id[tree]:
             self.my_parent_edge_id[tree] = <int*>self.mem.calloc(self.n, sizeof(int))
-            
+
         cdef int j
         for j in range(self.n):
             self.my_parent[tree][j] = 0
@@ -478,9 +478,9 @@ cdef class GabowEdgeConnectivity:
             self.labeled[tree][j] = False
             self.root[j] = j
             self.forests[j] = True
-        
+
         self.num_joins = 0
-        
+
         # Initialize T_k to be a DFS spanning forest of G \ T
         if self.dfs_preprocessing:
             self.compute_dfs_tree()
@@ -490,7 +490,7 @@ cdef class GabowEdgeConnectivity:
 
         self.L_roots[tree] = self.UNUSED
         self.tree_flag[tree] = False
-    
+
     cdef void compute_dfs_tree(self):
         r"""
         Find a DFS spanning forest of `G \backslash T`.
@@ -525,7 +525,7 @@ cdef class GabowEdgeConnectivity:
                     self.find_dfs_tree(r)
                 # Each call of find_dfs_tree creates an f-tree
                 self.num_start_f_trees += 1
-    
+
     cdef void find_dfs_tree(self, int r):
         r"""
         Find more vertices of the f-tree rooted at `r`.
@@ -604,7 +604,7 @@ cdef class GabowEdgeConnectivity:
                 self.num_joins += 1
                 # recursively find more vertices and grow the subtree rooted at r
                 self.find_dfs_tree_rec(v, r)
-        
+
     cdef int choose_root(self):
         """
         Return the root of an active f_tree, or INT_MAX if none exists.

src/sage/graphs/generators/classical_geometries.py

@@ -19,7 +19,7 @@
 # ****************************************************************************
 
 from sage.graphs.graph import Graph
-from sage.arith.all import is_prime_power
+from sage.arith.misc import is_prime_power
 from sage.rings.finite_rings.finite_field_constructor import FiniteField
 
 

src/sage/graphs/generators/families.py

@@ -2558,7 +2558,7 @@ def PaleyGraph(q):
     """
     from sage.rings.finite_rings.integer_mod import mod
     from sage.rings.finite_rings.finite_field_constructor import FiniteField
-    from sage.arith.all import is_prime_power
+    from sage.arith.misc import is_prime_power
     if not is_prime_power(q):
         raise ValueError("parameter q must be a prime power")
     if not mod(q, 4) == 1:
@@ -3933,7 +3933,7 @@ def MathonPseudocyclicStronglyRegularGraph(t, G=None, L=None):
     from sage.rings.integer_ring import ZZ
     from sage.matrix.constructor import matrix, block_matrix, \
         ones_matrix, identity_matrix
-    from sage.arith.all import two_squares
+    from sage.arith.misc import two_squares
     p = 4*t + 1
     try:
         x = two_squares(p)

src/sage/graphs/hyperbolicity.pyx

@@ -155,7 +155,7 @@ from cysignals.signals cimport sig_on, sig_off
 from memory_allocator cimport MemoryAllocator
 
 from sage.graphs.distances_all_pairs cimport c_distances_all_pairs
-from sage.arith.all import binomial
+from sage.arith.misc import binomial
 from sage.rings.integer_ring import ZZ
 from sage.rings.real_mpfr import RR
 from sage.data_structures.bitset import Bitset

src/sage/graphs/strongly_regular_db.pyx

@@ -32,7 +32,9 @@ import os
 
 from sage.categories.sets_cat import EmptySetError
 from sage.misc.unknown import Unknown
-from sage.arith.all import is_square, is_prime_power, divisors
+from sage.arith.misc import is_square
+from sage.arith.misc import is_prime_power
+from sage.arith.misc import divisors
 from sage.misc.cachefunc import cached_function
 from sage.combinat.designs.orthogonal_arrays import orthogonal_array
 from sage.combinat.designs.bibd import balanced_incomplete_block_design