Uses of Interface
com.jgalgo.alg.common.VertexBiPartition

Packages that use VertexBiPartition

Package	Description
com.jgalgo.alg.bipartite	Algorithms for solving bipartite graph problems.
com.jgalgo.alg.common	Package for common classes and interfaces used by the algorithms in the JGAlgo library.
com.jgalgo.alg.connect	Algorithms for solving connectivity problems, such as strongly/weakly connected components, minimum edge/vertex cuts, ect.

Uses of VertexBiPartition in com.jgalgo.alg.bipartite

Methods in com.jgalgo.alg.bipartite that return types with arguments of type VertexBiPartition

Modifier and Type	Method	Description
static <V, E> Optional<VertexBiPartition<V,E>>	BipartiteGraphs.findPartition(Graph<V,E> g)	Find a bipartite partition of the given graph (if one exists).
static <V, E> Optional<VertexBiPartition<V,E>>	BipartiteGraphs.findPartition(Graph<V,E> g, boolean addPartitionWeights)	Find a bipartite partition of the given graph (if one exists), and optionally add the partition as vertex weights.
static <V, E> Optional<VertexBiPartition<V,E>>	BipartiteGraphs.getExistingPartition(Graph<V,E> g)	Get the existing bipartite partition of the given graph from the vertices weights.

Uses of VertexBiPartition in com.jgalgo.alg.common

Subinterfaces of VertexBiPartition in com.jgalgo.alg.common

Modifier and Type	Interface	Description
interface	IVertexBiPartition	A partition of the vertices of an int graph into two blocks.

Methods in com.jgalgo.alg.common that return VertexBiPartition

Modifier and Type	Method	Description
static <V, E> VertexBiPartition<V,E>	VertexBiPartition.fromMap(Graph<V,E> g, Map<V,Boolean> map)	Create a new vertex bi-partition from a vertex-side map.
static <V, E> VertexBiPartition<V,E>	VertexBiPartition.fromMapping(Graph<V,E> g, Predicate<V> mapping)	Create a new vertex bi-partition from a vertex-side mapping function.
static <V, E> VertexBiPartition<V,E>	VertexBiPartition.fromWeights(Graph<V,E> g, WeightsBool<V> weights)	Create a new vertex bi-partition from a vertex-side weights container.
static <V, E> VertexBiPartition<V,E>	VertexBiPartition.partitionFromIndexPartition(Graph<V,E> g, IVertexBiPartition indexPartition)	Create a vertex bi-partition view from a vertex bi-partition of the index graph of the given graph.

Uses of VertexBiPartition in com.jgalgo.alg.connect

Methods in com.jgalgo.alg.connect that return VertexBiPartition

Modifier and Type	Method	Description
<V, E> VertexBiPartition<V,E>	MinimumEdgeCutGlobal.computeMinimumCut(Graph<V,E> g, WeightFunction<E> w)	Compute the global minimum edge-cut in a graph.
<V, E> VertexBiPartition<V,E>	MinimumEdgeCutGlobalAbstract.computeMinimumCut(Graph<V,E> g, WeightFunction<E> w)
<V, E> VertexBiPartition<V,E>	MinimumEdgeCutSt.computeMinimumCut(Graph<V,E> g, WeightFunction<E> w, Collection<V> sources, Collection<V> sinks)	Compute the minimum edge-cut in a graph between two sets of vertices.
<V, E> VertexBiPartition<V,E>	MinimumEdgeCutSt.computeMinimumCut(Graph<V,E> g, WeightFunction<E> w, V source, V sink)	Compute the minimum edge-cut in a graph between two terminal vertices.
<V, E> VertexBiPartition<V,E>	MinimumEdgeCutStAbstract.computeMinimumCut(Graph<V,E> g, WeightFunction<E> w, Collection<V> sources, Collection<V> sinks)
<V, E> VertexBiPartition<V,E>	MinimumEdgeCutStAbstract.computeMinimumCut(Graph<V,E> g, WeightFunction<E> w, V source, V sink)

Methods in com.jgalgo.alg.connect that return types with arguments of type VertexBiPartition

Modifier and Type	Method	Description
default <V, E> List<VertexBiPartition<V,E>>	MinimumEdgeCutAllSt.allMinimumCuts(Graph<V,E> g, WeightFunction<E> w, V source, V sink)	Compute all the minimum edge-cuts in a graph between two terminal vertices.
<V, E> Iterator<VertexBiPartition<V,E>>	MinimumEdgeCutAllSt.minimumCutsIter(Graph<V,E> g, WeightFunction<E> w, V source, V sink)	Iterate over all the minimum edge-cuts in a graph between two terminal vertices.
<V, E> Iterator<VertexBiPartition<V,E>>	MinimumEdgeCutAllStAbstract.minimumCutsIter(Graph<V,E> g, WeightFunction<E> w, V source, V sink)