what is the algorithm used for finding the minimum number of computers that must be eliminated from a network so that the network crashes ?
is this minimum cut ? how do I implement it in Pascal ?
10x
minimum cut ?
Moderator: Board moderators
minimum cut ?
When people agree with me I always feel that I must be wrong.
Minimum cut is the dual of maximum flow.
Given an identified 'source' node and an identified 'sink' node, compute the maximum flow from source to sink. This flow is the minimum cut - the minimal total cost of edges that must be cut to stop all flow from source to sink.
From your paraphrasal I don't think that you're asking for minimum cut.
Given an identified 'source' node and an identified 'sink' node, compute the maximum flow from source to sink. This flow is the minimum cut - the minimal total cost of edges that must be cut to stop all flow from source to sink.
From your paraphrasal I don't think that you're asking for minimum cut.