@graphty/algorithms / index / kargerMinCut

Function: kargerMinCut()

kargerMinCut(graph, iterations): MinCutResult

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

Karger's randomized min-cut algorithm Probabilistic algorithm that finds min cut with high probability

Parameters

graph

Undirected graph - accepts Graph class or Map representation

Graph | Map<string, Map<string, number>>

iterations

number = 100

Number of iterations (higher = better accuracy)

Returns

MinCutResult

Minimum cut found

Time Complexity: O(V² * iterations)