1 parent 2f53847 commit e3a03c5Copy full SHA for e3a03c5
2 files changed
networking_flow/Ford_Fulkerson.py
@@ -21,7 +21,7 @@ def BFS(graph, s, t, parent):
21
parent[ind] = u
22
23
return True if visited[t] else False
24
-
+
25
def FordFulkerson(graph, source, sink):
26
# This array is filled by BFS and to store path
27
parent = [-1]*(len(graph))
networking_flow/Minimum_cut.py
@@ -16,7 +16,7 @@ def BFS(graph, s, t, parent):
16
17
18
19
20
def mincut(graph, source, sink):
0 commit comments