triangulation.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_TRIANGULATION_H
#define GUM_TRIANGULATION_H

#include <vector>

#include <agrum/agrum.h>
#include <agrum/core/sequence.h>
#include <agrum/graphs/cliqueGraph.h>
#include <vector>

namespace gum {


  class Triangulation {
    public:
    // ############################################################################
    // ############################################################################

    virtual Triangulation* newFactory() const = 0;


    virtual Triangulation* copyFactory() const = 0;

    virtual ~Triangulation();



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


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

    virtual const EdgeSet& fillIns() = 0;

    virtual const std::vector< NodeId >& eliminationOrder() = 0;

    virtual Idx eliminationOrder(const NodeId) = 0;

    virtual const UndiGraph& triangulatedGraph() = 0;

    virtual const CliqueGraph& eliminationTree() = 0;

    virtual const CliqueGraph& junctionTree() = 0;


    double maxLog10CliqueDomainSize();

    virtual NodeId createdJunctionTreeClique(const NodeId id) = 0;

    virtual const NodeProperty< NodeId >& createdJunctionTreeCliques() = 0;


    virtual const CliqueGraph& maxPrimeSubgraphTree() = 0;

    virtual NodeId createdMaxPrimeSubgraph(const NodeId id) = 0;

    virtual void clear() = 0;

    const NodeProperty< Size >* domainSizes() const;



    protected:
    const NodeProperty< Size >* _domain_sizes{nullptr};


    Triangulation();


    Triangulation(const NodeProperty< Size >* domsizes);

    Triangulation(const Triangulation&);

    Triangulation(Triangulation&&);


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

} /* namespace gum */


#ifndef GUM_NO_INLINE
#  include <agrum/graphs/algorithms/triangulations/triangulation_inl.h>
#endif   // GUM_NO_INLINE


#endif /* GUM_TRIANGULATION_H */