triangulation.h

Go to the documentation of this file.

/****************************************************************************
 *   This file is part of the aGrUM/pyAgrum library.                        *
 *                                                                          *
 *   Copyright (c) 2005-2025 by                                             *
 *       - Pierre-Henri WUILLEMIN(_at_LIP6)                                 *
 *       - Christophe GONZALES(_at_AMU)                                     *
 *                                                                          *
 *   The aGrUM/pyAgrum library is free software; you can redistribute it    *
 *   and/or modify it under the terms of either :                           *
 *                                                                          *
 *    - the GNU Lesser General Public License as published by               *
 *      the Free Software Foundation, either version 3 of the License,      *
 *      or (at your option) any later version,                              *
 *    - the MIT license (MIT),                                              *
 *    - or both in dual license, as here.                                   *
 *                                                                          *
 *   (see https://agrum.gitlab.io/articles/dual-licenses-lgplv3mit.html)    *
 *                                                                          *
 *   This aGrUM/pyAgrum library is distributed in the hope that it will be  *
 *   useful, but WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,          *
 *   INCLUDING BUT NOT LIMITED TO THE WARRANTIES MERCHANTABILITY or FITNESS *
 *   FOR A PARTICULAR PURPOSE  AND NONINFRINGEMENT. IN NO EVENT SHALL THE   *
 *   AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER *
 *   LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,        *
 *   ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR  *
 *   OTHER DEALINGS IN THE SOFTWARE.                                        *
 *                                                                          *
 *   See LICENCES for more details.                                         *
 *                                                                          *
 *   SPDX-FileCopyrightText: Copyright 2005-2025                            *
 *       - Pierre-Henri WUILLEMIN(_at_LIP6)                                 *
 *       - Christophe GONZALES(_at_AMU)                                     *
 *   SPDX-License-Identifier: LGPL-3.0-or-later OR MIT                      *
 *                                                                          *
 *   Contact  : info_at_agrum_dot_org                                       *
 *   homepage : http://agrum.gitlab.io                                      *
 *   gitlab   : https://gitlab.com/agrumery/agrum                           *
 *                                                                          *
 ****************************************************************************/
 

#ifndef GUM_TRIANGULATION_H
#define GUM_TRIANGULATION_H
 
#include <vector>
 
#include <agrum/agrum.h>
 
#include <agrum/base/core/sequence.h>
#include <agrum/base/graphs/cliqueGraph.h>
 
namespace gum {
 

  class Triangulation {
    public:
    // ############################################################################
    // ############################################################################

    virtual Triangulation* newFactory() const = 0;


    virtual Triangulation* copyFactory() const = 0;

    virtual ~Triangulation();

 
 
    // ############################################################################
    // ############################################################################


    virtual void setGraph(const UndiGraph* graph, const NodeProperty< Size >* domsizes) = 0;

    virtual const EdgeSet& fillIns() = 0;

    virtual const std::vector< NodeId >& eliminationOrder() = 0;

    virtual Idx eliminationOrder(const NodeId) = 0;

    virtual const UndiGraph& triangulatedGraph() = 0;

    virtual const CliqueGraph& eliminationTree() = 0;

    virtual const CliqueGraph& junctionTree() = 0;


    double maxLog10CliqueDomainSize();

    virtual NodeId createdJunctionTreeClique(const NodeId id) = 0;

    virtual const NodeProperty< NodeId >& createdJunctionTreeCliques() = 0;


    virtual const CliqueGraph& maxPrimeSubgraphTree() = 0;

    virtual NodeId createdMaxPrimeSubgraph(const NodeId id) = 0;

    virtual void clear() = 0;

    const NodeProperty< Size >* domainSizes() const;

 
 
    protected:
    const NodeProperty< Size >* domain_sizes_{nullptr};
 

    Triangulation();


    Triangulation(const NodeProperty< Size >* domsizes);

    Triangulation(const Triangulation&);

    Triangulation(Triangulation&&);
 
 
    private:
    Triangulation& operator=(const Triangulation&);
  };
 
} /* namespace gum */
 
 
#ifndef GUM_NO_INLINE
#  include <agrum/base/graphs/algorithms/triangulations/triangulation_inl.h>
#endif   // GUM_NO_INLINE
 
 
#endif   /* GUM_TRIANGULATION_H */