Fix linter issues

Author: InnovativeInventor

gerrychain/graph/graph.py

@@ -351,7 +351,12 @@ class FrozenGraph:
         "networkx_retworkx_mapping"
     ]
 
-    def __init__(self, graph: Graph, pygraph: retworkx.PyGraph = None, mappings: Tuple[dict, dict] = None):
+    def __init__(
+        self,
+        graph: Graph,
+        pygraph: retworkx.PyGraph = None,
+        mappings: Tuple[dict, dict] = None
+    ):
         self.graph = networkx.classes.function.freeze(graph)
         self.graph.join = frozen
         self.graph.add_data = frozen
@@ -366,8 +371,12 @@ def __init__(self, graph: Graph, pygraph: retworkx.PyGraph = None, mappings: Tup
         if mappings:
             self.retworkx_networkx_mapping, self.networkx_retworkx_mapping = mappings
         else:
-            self.retworkx_networkx_mapping = {node: self.pygraph[node]["__networkx_node__"] for node in self.pygraph.node_indexes()}
-            self.networkx_retworkx_mapping = {self.pygraph[node]["__networkx_node__"]: node for node in self.pygraph.node_indexes()}
+            self.retworkx_networkx_mapping = {
+                n: self.pygraph[n]["__networkx_node__"] for n in self.pygraph.node_indexes()
+            }
+            self.networkx_retworkx_mapping = {
+                self.pygraph[n]["__networkx_node__"]: n for n in self.pygraph.node_indexes()
+            }
 
     def __len__(self):
         return self.size
@@ -405,7 +414,8 @@ def lookup(self, node, field):
         return self.graph.nodes[node][field]
 
     def subgraph(self, nodes):
-        return FrozenGraph(self.graph.subgraph(nodes), 
+        return FrozenGraph(
+            self.graph.subgraph(nodes),
             self.pygraph.subgraph(
                 [self.networkx_retworkx_mapping[x] for x in nodes]
             )

gerrychain/proposals/tree_proposals.py

@@ -1,10 +1,11 @@
 from functools import partial
-from ..random import random
 
+from ..random import random
 from ..tree import (
-    recursive_tree_part, bipartition_tree, bipartition_tree_random,
+    bipartition_tree_random,
     _bipartition_tree_random_all, uniform_spanning_tree,
     find_balanced_edge_cuts_memoization, bipartition_tree_retworkx
+    # recursive_tree_part, bipartition_tree,
 )
 
 

gerrychain/tree.py

@@ -183,7 +183,13 @@ def bipartition_tree_retworkx(
 ):
     pops = graph.pygraph_pop_lookup(pop_col)
 
-    balanced_node_choices = retworkx.bipartition_tree(graph.pygraph, lambda x: random.random(), pops, float(pop_target), float(epsilon))
+    balanced_node_choices = retworkx.bipartition_tree(
+        graph.pygraph,
+        lambda x: random.random(),
+        pops,
+        float(pop_target),
+        float(epsilon)
+    )
     balanced_nodes = {graph.retworkx_networkx_mapping[x] for x in choice(balanced_node_choices)[1]}
     return (balanced_nodes, graph.node_indices - balanced_nodes)