Content deleted Content added
→top: Reduce confusion by indicating alternative transliteration of Dinitz's name |
m Clearer abbreviation |
||
Line 24:
flow := 0 ''(Initialize flow to zero)''
'''repeat'''
''(Run a breadth-first search (bfs) to find the shortest s-t path.''
'' We use 'pred' to store the edge taken to get to each vertex,''
'' so we can recover the path afterwards)''
| |||