Geeksforgeeks

entities · 1 notes linked

Related: Graph Algorithms · Max Flow Min Cut · 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