Uses of Interface
com.jgalgo.alg.common.IVertexPartition
Packages that use IVertexPartition
Package
Description
Package for common classes and interfaces used by the algorithms in the JGAlgo library.
Algorithms for finding paths in graphs, such as shortest paths, iterating over all simple paths between two vertices,
computing the Voronoi cells given a set of sites, ect.
-
Uses of IVertexPartition in com.jgalgo.alg.common
Subinterfaces of IVertexPartition in com.jgalgo.alg.commonModifier and TypeInterfaceDescriptioninterface
A partition of the vertices of an int graph into two blocks.Methods in com.jgalgo.alg.common that return IVertexPartitionModifier and TypeMethodDescriptionstatic IVertexPartition
IVertexPartition.fromArray
(IndexGraph g, int[] vertexToBlock, int blocksNum) Create a new vertex partition from an array of vertex-blockIndex mapping.static IVertexPartition
IVertexPartition.fromMap
(IntGraph g, Int2IntMap map) Create a new vertex partition from a vertex-blockIndex map.static IVertexPartition
IVertexPartition.fromMapping
(IntGraph g, IntUnaryOperator mapping) Create a new vertex partition from a vertex-blockIndex mapping function.Methods in com.jgalgo.alg.common with parameters of type IVertexPartitionModifier and TypeMethodDescriptionstatic <V,
E> VertexPartition <V, E> VertexPartition.partitionFromIndexPartition
(Graph<V, E> g, IVertexPartition indexPartition) Create a vertex partition view from a vertex partition of the index graph of the given graph. -
Uses of IVertexPartition in com.jgalgo.alg.shortestpath
Methods in com.jgalgo.alg.shortestpath that return IVertexPartition