Ruff check

Author: prak74

graphs/directed_and_undirected_weighted_graph.py

@@ -102,24 +102,24 @@ def dfs(self, s=-2, d=-1):
         stack = []
         visited = []
         if s == -2:
-            if self.graph.get(s,None):
-                pass # -2 is a node
+            if self.graph.get(s, None):
+                pass  # -2 is a node
             elif len(self.graph) > 0:
                 s = next(iter(self.graph))
             else:
-                return [] # Graph empty
+                return []  # Graph empty
         stack.append(s)
 
         # Run dfs
         while len(stack) > 0:
             s = stack.pop()
             visited.append(s)
             # If reached d, return
-            if s==d:
+            if s == d:
                 break
 
             # add not visited child nodes to stack
-            for _,ss in self.graph[s]:
+            for _, ss in self.graph[s]:
                 if visited.count(ss) < 1:
                     stack.append(ss)
         return visited
@@ -164,12 +164,12 @@ def bfs(self, s=-2):
         d = deque()
         visited = []
         if s == -2:
-            if self.graph.get(s,None):
-                pass # -2 is a node
+            if self.graph.get(s, None):
+                pass  # -2 is a node
             elif len(self.graph) > 0:
                 s = next(iter(self.graph))
             else:
-                return [] # Graph empty
+                return []  # Graph empty
         d.append(s)
         visited.append(s)
         # Run bfs
@@ -413,12 +413,12 @@ def dfs(self, s=-2, d=-1):
         stack = []
         visited = []
         if s == -2:
-            if self.graph.get(s,None):
-                pass # -2 is a node
+            if self.graph.get(s, None):
+                pass  # -2 is a node
             elif len(self.graph) > 0:
                 s = next(iter(self.graph))
             else:
-                return [] # Graph empty
+                return []  # Graph empty
         stack.append(s)
 
         # Run dfs
@@ -429,11 +429,11 @@ def dfs(self, s=-2, d=-1):
             else:
                 visited.append(s)
             # If reached d, return
-            if s==d:
+            if s == d:
                 break
 
             # add not visited child nodes to stack
-            for _,ss in self.graph[s]:
+            for _, ss in self.graph[s]:
                 if visited.count(ss) < 1:
                     stack.append(ss)
         return visited
@@ -478,12 +478,12 @@ def bfs(self, s=-2):
         d = deque()
         visited = []
         if s == -2:
-            if self.graph.get(s,None):
-                pass # -2 is a node
+            if self.graph.get(s, None):
+                pass  # -2 is a node
             elif len(self.graph) > 0:
                 s = next(iter(self.graph))
             else:
-                return [] # Graph empty
+                return []  # Graph empty
         d.append(s)
         visited.append(s)
         while d: