Minimum cut

Home > Mathematics > Graph theory > Graph algorithms > Minimum cut

This algorithm is used to find the smallest cut in a graph, which is the smallest set of edges that, when removed, separates the source and sink.