Uses of Interface
org.graph4j.vsp.VertexSeparatorAlgorithm

Packages that use VertexSeparatorAlgorithm

Package	Description
org.graph4j.vsp	Algorithms for the Vertex Separator Problem (VSP).

Uses of VertexSeparatorAlgorithm in org.graph4j.vsp

Classes in org.graph4j.vsp that implement VertexSeparatorAlgorithm

Modifier and Type	Class	Description
class	BacktrackVertexSeparator	WORK IN PROGRESS.
class	GreedyVertexSeparator
class	VertexSeparatorBase	The vertex separator problem (VSP) is to find a partition of V into nonempty three classes A, B, C such that there is no edge between A and B, max(|A|,|B|) <= f(n) and |C| is minimum.

Methods in org.graph4j.vsp that return VertexSeparatorAlgorithm

Modifier and Type	Method	Description
static VertexSeparatorAlgorithm	VertexSeparatorAlgorithm.getInstance(Graph graph)	Returns the default implementation of this interface.