@graphty/algorithms / index / stoerWagner
Function: stoerWagner() ​
stoerWagner(
graph):MinCutResult
Defined in: flow/min-cut.ts:67
Stoer-Wagner algorithm for finding global minimum cut Finds the minimum cut that separates the graph into two parts
Parameters ​
graph ​
Undirected weighted graph - accepts Graph class or Map representation
Graph | Map<string, Map<string, number>>
Returns ​
Global minimum cut
Time Complexity: O(V³) or O(VE + V² log V) with heap