minor cleaning!

Author: PooriaNamyar

utils/near_wc_tm.py

@@ -6,7 +6,6 @@
 import igraph
 import numpy as np
 
-from networkx import nx
 from utils import shortest_path
 
 
@@ -43,7 +42,7 @@ def get_longest_matching_traffic_matrix(topology, tor_list, demand_dict):
     s = np.array(list(demand_dict.values()), order='F', dtype=np.uint16) * \
         (np.ones((num_nodes, num_nodes), order='F', dtype=np.uint16) - np.eye(num_nodes, order='F', dtype=np.uint16))
     minimum = np.min(np.array(list(demand_dict.values())))
-    coefficient = np.minimum(s, np.transpose(s))/minimum
+    coefficient = np.minimum(s, np.transpose(s)) / minimum
     weights = np.reshape(np.multiply(np_shortest_path, coefficient, dtype=np.float32, order='F'),
                          (1, num_nodes * num_nodes), order='F').tolist()[0]
     del s

utils/shortest_path.py

@@ -22,7 +22,7 @@ def sum_all_pair_shortest_path_length_adjacency_matrix(g):
     B = np.eye(num_node, order='F', dtype=np.float32)
     total_sp = num_node * (num_node - 1) - num_node
     C = np.zeros(np.shape(A), order='F', dtype=np.float32)
-    for k in range(num_node - 1):
+    for _ in range(num_node - 1):
         B = scipy.linalg.blas.sgemm(1, B, A)
         C = np.add(C, B)
         num = np.count_nonzero(C == 0)
@@ -52,7 +52,7 @@ def all_pair_shortest_path_length_adjacency_matrix(g, tor_list=None):
     C = np.eye(num_node, order='F', dtype=np.float32)
     shortest_path_np_array = np.ones(np.shape(A), order='F', dtype=np.float32)
 
-    for k in range(num_node - 1):
+    for _ in range(num_node - 1):
         B = scipy.linalg.blas.sgemm(1, B, A)
         C = np.add(C, B)
         if np.count_nonzero(C == 0) == 0: