Package com.jgalgo.alg.connect
Class MinimumVertexCutAllGlobalAbstract
- java.lang.Object
-
- com.jgalgo.alg.connect.MinimumVertexCutAllGlobalAbstract
-
- All Implemented Interfaces:
MinimumVertexCutAllGlobal
- Direct Known Subclasses:
MinimumVertexCutAllGlobalKanevsky
public abstract class MinimumVertexCutAllGlobalAbstract extends Object implements MinimumVertexCutAllGlobal
Abstract class for computing all global minimum vertex cuts in a graph.The class implements the interface by solving the problem on the index graph and then maps the results back to the original graph. The implementation for index graphs is abstract and left to the subclasses.
- Author:
- Barak Ugav
-
-
Constructor Summary
Constructors Constructor Description MinimumVertexCutAllGlobalAbstract()
Default constructor.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description <V,E>
Iterator<Set<V>>minimumCutsIter(Graph<V,E> g, WeightFunction<V> w)
Iterate over all the minimum vertex-cuts in a graph.-
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
-
-
-
-
Method Detail
-
minimumCutsIter
public <V,E> Iterator<Set<V>> minimumCutsIter(Graph<V,E> g, WeightFunction<V> w)
Description copied from interface:MinimumVertexCutAllGlobal
Iterate over all the minimum vertex-cuts in a graph.Given a graph \(G=(V,E)\), a vertex-cut is a set of vertices whose removal disconnect graph into more than one connected components.
If
g
is anIntGraph
, the returned iterator will iterate overIntSet
objects. In that case, its better to pass aIWeightFunction
asw
to avoid boxing/unboxing.- Specified by:
minimumCutsIter
in interfaceMinimumVertexCutAllGlobal
- Type Parameters:
V
- the vertices typeE
- the edges type- Parameters:
g
- the graphw
- a vertex weight function- Returns:
- an iterator over all the minimum vertex-cuts in a graph
-
-