orderedTriangulation.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_ORDERED_TRIANGULATION_H
#define GUM_ORDERED_TRIANGULATION_H

#include <vector>

#include <agrum/graphs/algorithms/triangulations/eliminationStrategies/orderedEliminationSequenceStrategy.h>
#include <agrum/graphs/algorithms/triangulations/junctionTreeStrategies/defaultJunctionTreeStrategy.h>
#include <agrum/graphs/algorithms/triangulations/staticTriangulation.h>

namespace gum {


  class OrderedTriangulation : public StaticTriangulation {
    public:
    // ############################################################################
    // ############################################################################


    OrderedTriangulation(
       const OrderedEliminationSequenceStrategy& elimSeq =
          OrderedEliminationSequenceStrategy(),
       const JunctionTreeStrategy& JTStrategy = DefaultJunctionTreeStrategy(),
       bool                        minimality = false);


    OrderedTriangulation(
       const UndiGraph*                          graph,
       const NodeProperty< Size >*               domsizes,
       const std::vector< NodeId >*              sequence,
       const OrderedEliminationSequenceStrategy& elimSeq =
          OrderedEliminationSequenceStrategy(),
       const JunctionTreeStrategy& JTStrategy = DefaultJunctionTreeStrategy(),
       bool                        minimality = false);

    OrderedTriangulation(const OrderedTriangulation& from);

    OrderedTriangulation(OrderedTriangulation&& from);

    virtual OrderedTriangulation* newFactory() const final;

    virtual OrderedTriangulation* copyFactory() const final;

    virtual ~OrderedTriangulation();


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


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


    virtual void setOrder(const std::vector< NodeId >* order) final;


    protected:

    virtual void _initTriangulation(UndiGraph& graph) final;



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


    private:
    OrderedTriangulation& operator=(const OrderedTriangulation&);
  };

} /* namespace gum */

#endif /* GUM_ORDERED_TRIANGULATION_H */