Uses of Interface
com.jgalgo.alg.common.IVertexBiPartition
Packages that use IVertexBiPartition
Package
Description
Algorithms for solving bipartite graph problems.
Package for common classes and interfaces used by the algorithms in the JGAlgo library.
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 IVertexBiPartitionModifier and TypeMethodDescriptionstatic Optional<IVertexBiPartition> BipartiteGraphs.getExistingPartition(IntGraph g) Get the existing bipartite partition of the givenIntGraphfrom the vertices weights. -
Uses of IVertexBiPartition in com.jgalgo.alg.common
Methods in com.jgalgo.alg.common that return IVertexBiPartitionModifier and TypeMethodDescriptionstatic IVertexBiPartitionIVertexBiPartition.fromBitmap(IndexGraph g, com.jgalgo.internal.util.Bitmap bitmap) Create a new vertex bi-partition from a bitmap.static IVertexBiPartitionCreate a new vertex bi-partition from a vertex-side map.static IVertexBiPartitionIVertexBiPartition.fromMapping(IntGraph g, IntPredicate mapping) Create a new vertex bi-partition from a vertex-side mapping function.static IVertexBiPartitionIVertexBiPartition.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 IVertexBiPartitionModifier and TypeMethodDescriptionstatic <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 IVertexBiPartitionModifier and TypeMethodDescriptionMaximumFlowPushRelabel.computeMinimumCut(IndexGraph g, IWeightFunction w, int source, int sink)