Uses of Class
org.graph4j.util.StableSet

Packages that use StableSet

Package	Description
org.graph4j.generators	Graph generators of various kinds.
org.graph4j.matching	Algorithms for determining matchings, such as the maximum cardinality matching in bipartite graphs.
org.graph4j.support	Support algorithms for various type of graphs (bipartite, tournament, etc.).

Uses of StableSet in org.graph4j.generators

Fields in org.graph4j.generators declared as StableSet

Modifier and Type	Field	Description
protected StableSet[]	RandomMultipartiteGenerator.stableSets

Methods in org.graph4j.generators that return StableSet

Modifier and Type	Method	Description
StableSet[]	RandomMultipartiteGenerator.getStableSets()	Returns the stable sets of the multipartite graph.

Uses of StableSet in org.graph4j.matching

Methods in org.graph4j.matching that return StableSet

Modifier and Type	Method	Description
StableSet	HopcroftKarpMaximumMatching.getMaximumStableSet()	niu(G) + alpha(G) = n.

Constructors in org.graph4j.matching with parameters of type StableSet

Modifier	Constructor	Description
	HopcroftKarpMaximumMatching(Graph graph, StableSet leftSide, StableSet rightSide)	Creates an algorithm for determining a maximum matching in a bipartite graph.

Uses of StableSet in org.graph4j.support

Methods in org.graph4j.support that return StableSet

Modifier and Type	Method	Description
StableSet	BipartiteGraphSupport.getLeftSide()	Returns the left side of the bipartition.
StableSet	BipartiteGraphSupport.getMaximumStableSet()	Determines a maximum stable set in a bipartite graph, using HopcroftKarpMaximumMatching algorithm.
StableSet	ChordalGraphSupport.getMaximumStableSet()	Determines a maximum stable set of a chordal graph.
StableSet	BipartiteGraphSupport.getRightSide()	Returns the right side of the bipartition.
StableSet	BipartiteGraphSupport.getSide(int v)	Determines the stable set of the partition where a specified vertex belongs to.