defaultEliminationSequenceStrategy.h

Go to the documentation of this file.

/***************************************************************************
 *   Copyright (C) 2005 by Christophe GONZALES and Pierre-Henri WUILLEMIN  *
 *   {prenom.nom}_at_lip6.fr                                               *
 *                                                                         *
 *   This program is free software; you can redistribute it and/or modify  *
 *   it under the terms of the GNU General Public License as published by  *
 *   the Free Software Foundation; either version 2 of the License, or     *
 *   (at your option) any later version.                                   *
 *                                                                         *
 *   This program is distributed in the hope that it will be useful,       *
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of        *
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         *
 *   GNU General Public License for more details.                          *
 *                                                                         *
 *   You should have received a copy of the GNU General Public License     *
 *   along with this program; if not, write to the                         *
 *   Free Software Foundation, Inc.,                                       *
 *   59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.             *
 ***************************************************************************/
#ifndef GUM_DEFAULT_ELIMINATION_SEQUENCE_STRATEGY_H
#define GUM_DEFAULT_ELIMINATION_SEQUENCE_STRATEGY_H


#include <agrum/agrum.h>
#include <agrum/graphs/algorithms/simplicialSet.h>
#include <agrum/graphs/algorithms/triangulations/eliminationStrategies/unconstrainedEliminationSequenceStrategy.h>
#include <agrum/graphs/graphElements.h>


namespace gum {


  class DefaultEliminationSequenceStrategy
      : public UnconstrainedEliminationSequenceStrategy {
    public:
    // ############################################################################
    // ############################################################################


    DefaultEliminationSequenceStrategy(double theRatio = GUM_QUASI_RATIO,
                                       double theThreshold = GUM_WEIGHT_THRESHOLD);


    DefaultEliminationSequenceStrategy(UndiGraph*                  graph,
                                       const NodeProperty< Size >* dom_sizes,
                                       double ratio = GUM_QUASI_RATIO,
                                       double threshold = GUM_WEIGHT_THRESHOLD);


    DefaultEliminationSequenceStrategy(
       const DefaultEliminationSequenceStrategy& from);

    DefaultEliminationSequenceStrategy(DefaultEliminationSequenceStrategy&&);

    virtual ~DefaultEliminationSequenceStrategy();

    virtual DefaultEliminationSequenceStrategy* newFactory() const final;


    virtual DefaultEliminationSequenceStrategy* copyFactory() const final;



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


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

    virtual void clear() final;


    virtual NodeId nextNodeToEliminate() final;

    virtual void askFillIns(bool do_it) final;

    virtual bool providesFillIns() const final;

    virtual bool providesGraphUpdate() const final;


    virtual void eliminationUpdate(const NodeId node) final;

    virtual const EdgeSet& fillIns() final;


    private:
    NodeProperty< double > __log_weights;

    SimplicialSet* __simplicial_set{nullptr};

    double __simplicial_ratio;

    double __simplicial_threshold;

    bool __provide_fill_ins{false};


    void __createSimplicialSet();
  };


} /* namespace gum */


#endif /* GUM_DEFAULT_ELIMINATION_SEQUENCE_STRATEGY_H */