clean of unnecessary checks, imports, calls (#7993)

networking_flow/ford_fulkerson.py

@@ -21,7 +21,7 @@ def bfs(graph, s, t, parent):
                 visited[ind] = True
                 parent[ind] = u
 
-    return True if visited[t] else False
+    return visited[t]
 
 
 def ford_fulkerson(graph, source, sink):

networking_flow/minimum_cut.py

@@ -24,7 +24,7 @@ def bfs(graph, s, t, parent):
                 visited[ind] = True
                 parent[ind] = u
 
-    return True if visited[t] else False
+    return visited[t]
 
 
 def mincut(graph, source, sink):