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

Packages that use VertexPartition

Package	Description
com.jgalgo.alg.color	Algorithms for solving graph coloring 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.
com.jgalgo.alg.shortestpath	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 VertexPartition in com.jgalgo.alg.color

Methods in com.jgalgo.alg.color that return VertexPartition

Modifier and Type	Method	Description
<V, E> VertexPartition<V,E>	ColoringAlgo.computeColoring(Graph<V,E> g)	Assign a color to each vertex of the given graph, while minimizing the number of different colors.
<V, E> VertexPartition<V,E>	ColoringAlgoAbstract.computeColoring(Graph<V,E> g)

Uses of VertexPartition in com.jgalgo.alg.common

Subinterfaces of VertexPartition in com.jgalgo.alg.common

Modifier and Type	Interface	Description
interface	IVertexBiPartition	A partition of the vertices of an int graph into two blocks.
interface	IVertexPartition	A partition of the vertices of an int graph.
interface	VertexBiPartition<V,E>	A partition of the vertices of a graph into two blocks.

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

Modifier and Type	Method	Description
static <V, E> VertexPartition<V,E>	VertexPartition.fromMap(Graph<V,E> g, Object2IntMap<V> map)	Create a new vertex partition from a vertex-blockIndex map.
static <V, E> VertexPartition<V,E>	VertexPartition.fromMapping(Graph<V,E> g, ToIntFunction<V> mapping)	Create a new vertex partition from a vertex-blockIndex mapping function.
static <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 VertexPartition in com.jgalgo.alg.connect

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

Modifier and Type	Method	Description
<V, E> VertexPartition<V,E>	KEdgeConnectedComponentsAlgo.computeKEdgeConnectedComponents(Graph<V,E> g, int k)	Compute the k-edge connected components of a graph.
<V, E> VertexPartition<V,E>	KEdgeConnectedComponentsAlgoAbstract.computeKEdgeConnectedComponents(Graph<V,E> g, int k)
<V, E> VertexPartition<V,E>	StronglyConnectedComponentsAlgo.findStronglyConnectedComponents(Graph<V,E> g)	Find all strongly connected components in a graph.
<V, E> VertexPartition<V,E>	StronglyConnectedComponentsAlgoAbstract.findStronglyConnectedComponents(Graph<V,E> g)
<V, E> VertexPartition<V,E>	WeaklyConnectedComponentsAlgo.findWeaklyConnectedComponents(Graph<V,E> g)	Compute all weakly connected components in a graph.
<V, E> VertexPartition<V,E>	WeaklyConnectedComponentsAlgoAbstract.findWeaklyConnectedComponents(Graph<V,E> g)

Uses of VertexPartition in com.jgalgo.alg.shortestpath

Methods in com.jgalgo.alg.shortestpath that return VertexPartition

Modifier and Type	Method	Description
VertexPartition<V,E>	VoronoiAlgo.Result.partition()	Get the partition of the graph to blocks where each block contains the vertices which are closest to a single site.