formatting

Author: tomvanmele

src/compas/datastructures/graph/graph.py

@@ -134,21 +134,15 @@ def __data__(self):
 
     def __before_json_dump__(self, data):
         data["node"] = {repr(key): attr for key, attr in data["node"].items()}
-        data["edge"] = {
-            repr(u): {repr(v): attr for v, attr in nbrs.items()}
-            for u, nbrs in data["edge"].items()
-        }
+        data["edge"] = {repr(u): {repr(v): attr for v, attr in nbrs.items()} for u, nbrs in data["edge"].items()}
         return data
 
     def __after_json_load__(self, data):
         l_e = literal_eval
         nodes = data["node"] or {}
         edges = data["edge"] or {}
         data["node"] = {l_e(node): attr for node, attr in nodes.items()}
-        data["edge"] = {
-            l_e(u): {l_e(v): attr for v, attr in nbrs.items()}
-            for u, nbrs in edges.items()
-        }
+        data["edge"] = {l_e(u): {l_e(v): attr for v, attr in nbrs.items()} for u, nbrs in edges.items()}
         return data
 
     @classmethod
@@ -1974,9 +1968,7 @@ def has_edge(self, edge, directed=True):
         u, v = edge
         if directed:
             return u in self.edge and v in self.edge[u]
-        return (u in self.edge and v in self.edge[u]) or (
-            v in self.edge and u in self.edge[v]
-        )
+        return (u in self.edge and v in self.edge[u]) or (v in self.edge and u in self.edge[v])
 
     # --------------------------------------------------------------------------
     # Node geometry
@@ -2064,11 +2056,7 @@ def node_neighborhood_centroid(self, key):
         :meth:`node_coordinates`, :meth:`node_point`, :meth:`node_laplacian`
 
         """
-        return Point(
-            *centroid_points(
-                [self.node_coordinates(nbr) for nbr in self.neighbors(key)]
-            )
-        )
+        return Point(*centroid_points([self.node_coordinates(nbr) for nbr in self.neighbors(key)]))
 
     # --------------------------------------------------------------------------
     # Edge geometry
@@ -2348,10 +2336,7 @@ def connected_edges(self):
         :meth:`connected_nodes`
 
         """
-        return [
-            [(u, v) for u in nodes for v in self.neighbors(u) if u < v]
-            for nodes in self.connected_nodes()
-        ]
+        return [[(u, v) for u in nodes for v in self.neighbors(u) if u < v] for nodes in self.connected_nodes()]
 
     def exploded(self):
         """Explode the graph into its connected components.
@@ -2438,9 +2423,7 @@ def adjacency_matrix(self, rtype="array"):
         from compas.matrices import adjacency_matrix
 
         node_index = self.node_index()
-        adjacency = [
-            [node_index[nbr] for nbr in self.neighbors(key)] for key in self.nodes()
-        ]
+        adjacency = [[node_index[nbr] for nbr in self.neighbors(key)] for key in self.nodes()]
         return adjacency_matrix(adjacency, rtype=rtype)
 
     def connectivity_matrix(self, rtype="array"):
@@ -2480,9 +2463,7 @@ def degree_matrix(self, rtype="array"):
         from compas.matrices import degree_matrix
 
         node_index = self.node_index()
-        adjacency = [
-            [node_index[nbr] for nbr in self.neighbors(key)] for key in self.nodes()
-        ]
+        adjacency = [[node_index[nbr] for nbr in self.neighbors(key)] for key in self.nodes()]
         return degree_matrix(adjacency, rtype=rtype)
 
     def laplacian_matrix(self, normalize=False, rtype="array"):

src/compas/geometry/polyhedron.py

@@ -319,9 +319,7 @@ def lines(self):
 
     @property
     def polygons(self):
-        return [
-            Polygon([self.vertices[index] for index in face]) for face in self.faces
-        ]
+        return [Polygon([self.vertices[index] for index in face]) for face in self.faces]
 
     @property
     def planes(self):
@@ -390,9 +388,7 @@ def from_platonicsolid(cls, f):
         elif f == 20:
             vertices, faces = icosahedron()
         else:
-            raise ValueError(
-                "The number of sides of a platonic solid must be one of: 4, 6, 8, 12, 20."
-            )
+            raise ValueError("The number of sides of a platonic solid must be one of: 4, 6, 8, 12, 20.")
         solid = cls(vertices, faces)
         return solid
 
@@ -443,9 +439,7 @@ def from_halfspaces(cls, halfspaces, interior_point):
         interior_point = asarray(interior_point, dtype=float)
         hsi = HalfspaceIntersection(halfspaces, interior_point)
         hull = ConvexHull(hsi.intersections)
-        mesh = Mesh.from_vertices_and_faces(
-            [hsi.intersections[i] for i in hull.vertices], hull.simplices
-        )
+        mesh = Mesh.from_vertices_and_faces([hsi.intersections[i] for i in hull.vertices], hull.simplices)
         mesh.unify_cycles()
         to_merge = []
         for a, b in combinations(mesh.faces(), 2):