orderedEliminationSequenceStrategy.h

Go to the documentation of this file.

#ifndef GUM_ORDERED_ELIMINATION_SEQUENCE_STRATEGY_H
#define GUM_ORDERED_ELIMINATION_SEQUENCE_STRATEGY_H

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

namespace gum {

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

    OrderedEliminationSequenceStrategy();


    OrderedEliminationSequenceStrategy(UndiGraph*                   graph,
                                       const NodeProperty< Size >*  dom_sizes,
                                       const std::vector< NodeId >* order);

    OrderedEliminationSequenceStrategy(
       const OrderedEliminationSequenceStrategy& from);

    OrderedEliminationSequenceStrategy(OrderedEliminationSequenceStrategy&& from);

    virtual ~OrderedEliminationSequenceStrategy();

    virtual OrderedEliminationSequenceStrategy* newFactory() const final;

    virtual OrderedEliminationSequenceStrategy* copyFactory() const final;



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


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


    virtual bool setOrder(const std::vector< NodeId >* order) 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;

    const std::vector< NodeId >* order() const noexcept;


    bool isOrderNeeded() const noexcept;



    private:
    const std::vector< NodeId >* __order{nullptr};

    std::size_t __order_index{std::size_t(0)};

    bool __order_needed{true};


    bool __isOrderNeeded(const std::vector< NodeId >* order) const;
  };


} /* namespace gum */


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


#endif /* GUM_ORDERED_ELIMINATION_SEQUENCE_STRATEGY_H */