Class ChordalGraphColoring<V,​E>

  • Type Parameters:
    V - the graph vertex type.
    E - the graph edge type.
    All Implemented Interfaces:

    public class ChordalGraphColoring<V,​E>
    extends java.lang.Object
    implements VertexColoringAlgorithm<V>
    Calculates a minimum vertex coloring for a chordal graph. A chordal graph is a simple graph in which all cycles of four or more vertices have a chord. A chord is an edge that is not part of the cycle but connects two vertices of the cycle. To compute the vertex coloring, this implementation relies on the ChordalityInspector to compute a perfect elimination order. The vertex coloring for a chordal graph is computed in $\mathcal{O}(|V| + |E|)$ time. All the methods in this class are invoked in a lazy fashion, meaning that computations are only started once the method gets invoked.
    Timofey Chudakov
    • Method Detail

      • getPerfectEliminationOrder

        public java.util.List<V> getPerfectEliminationOrder()
        Returns the perfect elimination order used to create the coloring (if one exists). This method returns null if the graph is not chordal.
        the perfect elimination order used to create the coloring, or null if graph is not chordal.