Uses of Interface com.jgalgo.alg.VertexBiPartition (JGAlgo - Parent 0.3.0 API)

Packages that use VertexBiPartition
Package Description

com.jgalgo.alg
Algorithms for solving graph problems.

Uses of VertexBiPartition in com.jgalgo.alg

Subinterfaces of VertexBiPartition in com.jgalgo.alg
Modifier and Type	Interface	Description
`interface`	`IVertexBiPartition`	A partition of the vertices of an int graph into two blocks.

Methods in com.jgalgo.alg 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>`	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.
`static <V,E> VertexBiPartition<V,E>`	VertexBiPartition.`fromMap(Graph<V,E> g, Object2BooleanMap<V> 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.

Methods in com.jgalgo.alg 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.
`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 addPartitionWeight)`	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 (if one exists).
`<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.