partialOrderedEliminationSequenceStrategy.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_PARTIAL_ORDERED_ELIMINATION_SEQUENCE_STRATEGY_H
#define GUM_PARTIAL_ORDERED_ELIMINATION_SEQUENCE_STRATEGY_H

#include <agrum/core/list.h>
#include <agrum/graphs/algorithms/triangulations/eliminationStrategies/eliminationSequenceStrategy.h>

namespace gum {

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

    virtual ~PartialOrderedEliminationSequenceStrategy();

    virtual PartialOrderedEliminationSequenceStrategy* newFactory() const = 0;

    virtual PartialOrderedEliminationSequenceStrategy* copyFactory() const = 0;



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


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


    virtual bool setPartialOrder(const List< NodeSet >* subsets);

    virtual void clear();

    const List< NodeSet >* partialOrder() const noexcept;


    bool isPartialOrderNeeded() const noexcept;



    protected:
    const List< NodeSet >* _subsets{nullptr};

    List< NodeSet >::const_iterator _subset_iter;

    NodeSet _nodeset;

    bool _partial_order_needed{true};



    bool _isPartialOrderNeeded(const List< NodeSet >* subsets) const;


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

    PartialOrderedEliminationSequenceStrategy();


    PartialOrderedEliminationSequenceStrategy(
       UndiGraph*                  graph,
       const NodeProperty< Size >* dom_sizes,
       const List< NodeSet >*      subsets);

    PartialOrderedEliminationSequenceStrategy(
       const PartialOrderedEliminationSequenceStrategy&);

    PartialOrderedEliminationSequenceStrategy(
       PartialOrderedEliminationSequenceStrategy&&);

  };

} /* namespace gum */


#ifndef GUM_NO_INLINE
#  include <agrum/graphs/algorithms/triangulations/eliminationStrategies/partialOrderedEliminationSequenceStrategy_inl.h>
#endif   // GUM_NOINLINE


#endif /* GUM_PARTIAL_ORDERED_ELIMINATION_SEQUENCE_STRATEGY_H */