Package com.jgalgo.alg.connect

Class MinimumVertexCutAllGlobalKanevsky

java.lang.Object

com.jgalgo.alg.connect.MinimumVertexCutAllGlobalAbstract

com.jgalgo.alg.connect.MinimumVertexCutAllGlobalKanevsky

All Implemented Interfaces:

MinimumVertexCutAllGlobal

public class MinimumVertexCutAllGlobalKanevsky
extends MinimumVertexCutAllGlobalAbstract

Kanevsky algorithm for computing all minimum unweighted vertex cuts in a graph.

Based on 'Finding all minimum-size separating vertex sets in a graph' by A. Kanevsky (1993).

Author:

Barak Ugav

Constructor Summary

Constructors

Constructor	Description
MinimumVertexCutAllGlobalKanevsky()	Create a new instance of the algorithm.

Method Summary

Methods inherited from class com.jgalgo.alg.connect.MinimumVertexCutAllGlobalAbstract

minimumCutsIter

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface com.jgalgo.alg.connect.MinimumVertexCutAllGlobal

allMinimumCuts

Constructor Details

MinimumVertexCutAllGlobalKanevsky

public MinimumVertexCutAllGlobalKanevsky()

Create a new instance of the algorithm.

Please prefer using MinimumVertexCutAllGlobal.newInstance() to get a default implementation for the MinimumVertexCutAllGlobal interface.