Perfect graphs


Enumerations

enum  abstractMixedGraph::TOptComplement {
  abstractMixedGraph::PERFECT_AS_IS = 0,
  abstractMixedGraph::PERFECT_COMPLEMENT = 1
}

Functions

TNode abstractMixedGraph::PerfectEliminationOrder (TOptComplement complementarityMode=PERFECT_AS_IS) throw ()
bool abstractMixedGraph::IsChordal (TOptComplement complementarityMode=PERFECT_AS_IS) throw ()

Enumeration Type Documentation

enum TOptComplement [inherited]
 

Complementarity option for perfect graph methods.

Enumerator:
PERFECT_AS_IS  Apply method to the addressed graph.
PERFECT_COMPLEMENT  Apply method to the implicitly given complementary graph.

Function Documentation

bool IsChordal (  TOptComplement  complementarityMode = PERFECT_AS_IS  )  throw () [inherited]
 

Perform a chordality test.

Parameters:
complementarityMode Specifies if the method addresses the given or the complementary graph
Return values:
true This graph is chordal, that is, a perfect elimnation order has been found

TNode PerfectEliminationOrder (  TOptComplement  complementarityMode = PERFECT_AS_IS  )  throw () [inherited]
 

Determine a perfect elimination order and a simplicial node.

This assigns the node colours with a certain node order. If the graph is chordal, this is a so-called perfect elimination order, and the returned node is simplicial, that is, its neighbours form a clique.

Parameters:
complementarityMode Specifies if the method addresses the given or the complementary graph
Returns:
The index of the node which comes first in the order (which has node colour 0)