diff --git a/networking_flow/Ford_Fulkerson.py b/networking_flow/Ford_Fulkerson.py
index 08749b3da..d51f1f066 100644
--- a/networking_flow/Ford_Fulkerson.py
+++ b/networking_flow/Ford_Fulkerson.py
@@ -21,7 +21,7 @@ def BFS(graph, s, t, parent):
                 parent[ind] = u
 
     return True if visited[t] else False
-
+     
 def FordFulkerson(graph, source, sink):
     # This array is filled by BFS and to store path
     parent = [-1]*(len(graph))
diff --git a/networking_flow/Minimum_cut.py b/networking_flow/Minimum_cut.py
index 0a61db49b..8ad6e03b0 100644
--- a/networking_flow/Minimum_cut.py
+++ b/networking_flow/Minimum_cut.py
@@ -16,7 +16,7 @@ def BFS(graph, s, t, parent):
                 parent[ind] = u
 
     return True if visited[t] else False
-
+ 
 def mincut(graph, source, sink):
     # This array is filled by BFS and to store path
     parent = [-1]*(len(graph))