Method: Plexus::UndirectedGraphBuilder::Algorithms#split?

Defined in:

lib/plexus/undirected_graph/algorithms.rb

#split? ⇒ Boolean

An undirected graph is defined to be split if there is a partition V = S + K of its vertex set into a stable set S and a complete set K.

Returns:

• (Boolean)

# File 'lib/plexus/undirected_graph/algorithms.rb', line 69

def split?() triangulated? and complement.triangulated?; end