Max Flow Min Cut

concepts · 1 notes linked

Related: Geeksforgeeks · Graph Algorithms · Ford Fulkerson Algorithm · Network Flow

Notes

• Find minimum s-t cut in a flow network - GeeksforGeeks — Ford-Fulkerson-based algorithm to identify minimum capacity cut edges in a flow network