triangulation.cpp

Go to the documentation of this file.

/**
 *
 *   Copyright 2005-2020 Pierre-Henri WUILLEMIN(@LIP6) & Christophe GONZALES(@AMU)
 *   info_at_agrum_dot_org
 *
 *  This library is free software: you can redistribute it and/or modify
 *  it under the terms of the GNU Lesser General Public License as published by
 *  the Free Software Foundation, either version 3 of the License, or
 *  (at your option) any later version.
 *
 *  This library 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 Lesser General Public License for more details.
 *
 *  You should have received a copy of the GNU Lesser General Public License
 *  along with this library.  If not, see <http://www.gnu.org/licenses/>.
 *
 */


/** @file
 * @brief Abstract base class for computing triangulations of graphs
 *
 * @author Christophe GONZALES(@AMU) and Pierre-Henri WUILLEMIN(@LIP6)
 */

#include <agrum/agrum.h>
#include <agrum/tools/core/math/math_utils.h>
#include <agrum/tools/graphs/algorithms/triangulations/triangulation.h>

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

namespace gum {

  // constructor
  Triangulation::Triangulation() {
    // for debugging purposes
    GUM_CONSTRUCTOR(Triangulation);
  }

  // constructor with a domain size specified
  Triangulation::Triangulation(const NodeProperty< Size >* domsizes) :
      domain_sizes_(domsizes) {
    GUM_CONSTRUCTOR(Triangulation);
  }

  // destructor
  Triangulation::~Triangulation() {
    // for debugging purposes
    GUM_DESTRUCTOR(Triangulation);
  }

  // copy constructor
  Triangulation::Triangulation(const Triangulation& from) :
      domain_sizes_(from.domain_sizes_) {
    GUM_CONS_CPY(Triangulation);
  }

  // move constructor
  Triangulation::Triangulation(Triangulation&& from) :
      domain_sizes_(from.domain_sizes_) {
    GUM_CONS_MOV(Triangulation);
  }

  // returns the max of log10DomainSize of cliques in the junction tree
  double Triangulation::maxLog10CliqueDomainSize() {
    double              res = 0.0;
    double              dSize;
    const JunctionTree& jt = junctionTree();   // here, the fact that we get
    // a junction tree ensures that domain_sizes_ is different from nullptr

    for (const NodeId cl: jt) {
      dSize = 0.0;

      for (const auto node: jt.clique(cl))
        dSize += std::log10((*domain_sizes_)[node]);

      if (res < dSize) res = dSize;
    }

    return res;
  }

} /* namespace gum */