Fixed linter errors

Author: mjanos5

patterns/creational/lazy_evaluation.py

@@ -39,8 +39,8 @@ def lazy_property2(fn):
     """
     A lazy property decorator.
 
-    The function decorated is called the first time to retrieve the result and then that calculated result is used the next
-    time you access the value.
+    The function decorated is called the first time to retrieve the result and
+    then that calculated result is used the next time you access the value.
     """
     attr = "_lazy__" + fn.__name__
 

patterns/other/graph_search.py

@@ -58,8 +58,10 @@ def find_shortest_path_bfs(self, start, end):
             :type end: str or int
 
             :returns queue_path_to_end, dist_to[end]: A list of nodes
-        representing the shortest path from `start` to `end`, and a dictionary mapping each node in the graph (except for `start`) with its distance from it
-        (in terms of hops). If no such path exists, returns an empty list and an empty dictionary instead.
+        representing the shortest path from `start` to `end`, and a dictionary
+        mapping each node in the graph (except for `start`) with its distance from it
+        (in terms of hops). If no such path exists, returns an empty list and an empty
+        dictionary instead.
         """
         queue = [start]
         dist_to = {start: 0}