mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-03-11 00:59:49 +00:00
Code Issues Packages Projects Releases Wiki Activity

networking_flow

Browse Source
This commit is contained in:
Sichen Liu 2018-03-08 15:53:10 -05:00
parent 2f53847247
commit e3a03c559e
2 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
networking_flow/Ford_Fulkerson.py
View File

@ -21,7 +21,7 @@ def BFS(graph, s, t, parent):
parent[ind] = u parent[ind] = u
return True if visited[t] else False return True if visited[t] else False
def FordFulkerson(graph, source, sink): def FordFulkerson(graph, source, sink):
# This array is filled by BFS and to store path # This array is filled by BFS and to store path
parent = [-1]*(len(graph)) parent = [-1]*(len(graph))

2
networking_flow/Minimum_cut.py
View File

@ -16,7 +16,7 @@ def BFS(graph, s, t, parent):
parent[ind] = u parent[ind] = u
return True if visited[t] else False return True if visited[t] else False
def mincut(graph, source, sink): def mincut(graph, source, sink):
# This array is filled by BFS and to store path # This array is filled by BFS and to store path
parent = [-1]*(len(graph)) parent = [-1]*(len(graph))