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

Packages that use IVertexBiPartition

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.flow	Algorithms for solving flow problems in graphs, such as maximum flow, min cost flow, and circulation problems.

Uses of IVertexBiPartition in com.jgalgo.alg.bipartite

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

Modifier and Type	Method	Description
static Optional<IVertexBiPartition>	BipartiteGraphs.getExistingPartition(IntGraph g)	Get the existing bipartite partition of the given IntGraph from the vertices weights.

Uses of IVertexBiPartition in com.jgalgo.alg.common

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

Modifier and Type	Method	Description
static IVertexBiPartition	IVertexBiPartition.fromBitmap(IndexGraph g, com.jgalgo.internal.util.Bitmap bitmap)	Create a new vertex bi-partition from a bitmap.
static IVertexBiPartition	IVertexBiPartition.fromMap(IntGraph g, Map<Integer,Boolean> map)	Create a new vertex bi-partition from a vertex-side map.
static IVertexBiPartition	IVertexBiPartition.fromMapping(IntGraph g, IntPredicate mapping)	Create a new vertex bi-partition from a vertex-side mapping function.
static IVertexBiPartition	IVertexBiPartition.fromWeights(IntGraph g, IWeightsBool weights)	Create a new vertex bi-partition from a vertex-side weights container.

Methods in com.jgalgo.alg.common with parameters of type IVertexBiPartition

Modifier and Type	Method	Description
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 IVertexBiPartition in com.jgalgo.alg.flow

Methods in com.jgalgo.alg.flow that return IVertexBiPartition

Modifier and Type	Method	Description
IVertexBiPartition	MaximumFlowPushRelabel.computeMinimumCut(IndexGraph g, IWeightFunction w, int source, int sink)