Method: Plexus::UndirectedGraphBuilder::Algorithms#permutation?

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

#permutation? ⇒ Boolean

A permutation diagram consists of n points on each of two parallel lines and n straight line segments matchin the points. The intersection graph of the line segments is called a permutation graph.

Returns:

  • (Boolean) 


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

def permutation?() comparability? and complement.comparability?; end