Method: Plexus::UndirectedGraphBuilder::Algorithms#interval?

Defined in:
lib/plexus/undirected_graph/algorithms.rb

#interval? ⇒ Boolean

An interval graph can have its vertices into one-to-one correspondence with a set of intervals F of a linearly ordered set (like the real line) such that two vertices are connected by an edge of G if and only if their corresponding intervals have nonempty intersection.

Returns:

  • (Boolean) 


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

def interval?() triangulated? and complement.comparability?; end