Package com.jgalgo.alg.connect
Class MinimumVertexCutGlobalEsfahanianHakimi
java.lang.Object
com.jgalgo.alg.connect.MinimumVertexCutGlobalAbstract
com.jgalgo.alg.connect.MinimumVertexCutGlobalEsfahanianHakimi
- All Implemented Interfaces:
MinimumVertexCutGlobal
Esfahanian-Hakimi algorithm for computing a minimum unweighted vertex cut in a graph.
Based on 'On computing the connectivities of graphs and digraphs' by Abdol H. Esfahanian, S. Louis Hakimi.
- Author:
- Barak Ugav
-
Constructor Summary
ConstructorDescriptionCreate a new instance of the algorithm. -
Method Summary
Methods inherited from class com.jgalgo.alg.connect.MinimumVertexCutGlobalAbstract
computeMinimumCut
-
Constructor Details
-
MinimumVertexCutGlobalEsfahanianHakimi
public MinimumVertexCutGlobalEsfahanianHakimi()Create a new instance of the algorithm.Please prefer using
MinimumVertexCutGlobal.newInstance()
to get a default implementation for theMinimumVertexCutGlobal
interface.
-