@graphty/algorithms / index / minSTCut

Function: minSTCut()

minSTCut(graph, source, sink): MinCutResult

Defined in: flow/min-cut.ts:28

Find minimum s-t cut using max flow The minimum cut value equals the maximum flow value (max-flow min-cut theorem)

Parameters

graph

Graph

Weighted graph

source

string

Source node

sink

string

Sink node

Returns

MinCutResult

Minimum cut information

Time Complexity: Same as max flow algorithm used