eliminationSequenceStrategy.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_ELIMINATION_SEQUENCE_STRATEGY_H
#define GUM_ELIMINATION_SEQUENCE_STRATEGY_H
 
#include <agrum/agrum.h>
 
#include <agrum/base/graphs/undiGraph.h>
 
namespace gum {

  class EliminationSequenceStrategy {
    public:
    // ############################################################################
    // ############################################################################

    virtual ~EliminationSequenceStrategy();

    virtual EliminationSequenceStrategy* newFactory() const = 0;


    virtual EliminationSequenceStrategy* copyFactory() const = 0;

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


    virtual bool setGraph(UndiGraph* graph, const NodeProperty< Size >* dom_sizes);


    virtual NodeId nextNodeToEliminate() = 0;

    virtual void askFillIns(bool do_it) = 0;

    virtual bool providesFillIns() const = 0;

    virtual bool providesGraphUpdate() const = 0;


    virtual void eliminationUpdate(const NodeId node);

    virtual const EdgeSet& fillIns();

    virtual void clear();

    UndiGraph* graph() const noexcept;

    const NodeProperty< Size >* domainSizes() const noexcept;

 
 
    protected:
    UndiGraph* graph_{nullptr};

    const NodeProperty< Size >* domain_sizes_{nullptr};

    NodeProperty< double > log_domain_sizes_;
 
 
    // ############################################################################
    // ############################################################################

    EliminationSequenceStrategy();

    EliminationSequenceStrategy(UndiGraph* graph, const NodeProperty< Size >* domain_sizes);

    EliminationSequenceStrategy(const EliminationSequenceStrategy& from);

    EliminationSequenceStrategy(EliminationSequenceStrategy&& from);

 
    private:
    static const EdgeSet& _empty_fill_ins_();
  };
 
 
} /* namespace gum */
 
 
#ifndef GUM_NO_INLINE
#  include <agrum/base/graphs/algorithms/triangulations/eliminationStrategies/eliminationSequenceStrategy_inl.h>
#endif   // GU%_NO_INLINE
 
 
#endif   /* GUM_ELIMINATION_SEQUENCE_STRATEGY_H */