/****************************************************************************
 *   This file is part of the aGrUM/pyAgrum library.                        *
 *                                                                          *
 *   Copyright (c) 2005-2026 by                                             *
 *       - Pierre-Henri WUILLEMIN(_at_LIP6)                                 *
 *       - Christophe GONZALES(_at_AMU)                                     *
 *                                                                          *
 *   The aGrUM/pyAgrum library is free software; you can redistribute it    *
 *   and/or modify it under the terms of either :                           *
 *                                                                          *
 *    - 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,                              *
 *    - the MIT license (MIT),                                              *
 *    - or both in dual license, as here.                                   *
 *                                                                          *
 *   (see https://agrum.gitlab.io/articles/dual-licenses-lgplv3mit.html)    *
 *                                                                          *
 *   This aGrUM/pyAgrum library is distributed in the hope that it will be  *
 *   useful, but WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,          *
 *   INCLUDING BUT NOT LIMITED TO THE WARRANTIES MERCHANTABILITY or FITNESS *
 *   FOR A PARTICULAR PURPOSE  AND NONINFRINGEMENT. IN NO EVENT SHALL THE   *
 *   AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER *
 *   LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,        *
 *   ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR  *
 *   OTHER DEALINGS IN THE SOFTWARE.                                        *
 *                                                                          *
 *   See LICENCES for more details.                                         *
 *                                                                          *
 *   SPDX-FileCopyrightText: Copyright 2005-2026                            *
 *       - Pierre-Henri WUILLEMIN(_at_LIP6)                                 *
 *       - Christophe GONZALES(_at_AMU)                                     *
 *   SPDX-License-Identifier: LGPL-3.0-or-later OR MIT                      *
 *                                                                          *
 *   Contact  : info_at_agrum_dot_org                                       *
 *   homepage : http://agrum.gitlab.io                                      *
 *   gitlab   : https://gitlab.com/agrumery/agrum                           *
 *                                                                          *
 ****************************************************************************/


#include <agrum/base/graphicalModels/UGmodel.h>

#ifdef GUM_NO_INLINE
#  include <agrum/base/graphicalModels/UGmodel_inl.h>
#endif /* GUM_NO_INLINE */

namespace gum {
  UGmodel::UGmodel() { GUM_CONSTRUCTOR(UGmodel); }

  UGmodel::UGmodel(const UGmodel& from) : DiscreteGraphicalModel(from), graph_(from.graph_) {
    GUM_CONS_CPY(UGmodel);
  }

  UGmodel::UGmodel(UGmodel&& from) :
      DiscreteGraphicalModel(std::move(from)), graph_(std::move(from.graph_)) {
    GUM_CONS_MOV(UGmodel);
  }

  UGmodel::~UGmodel() { GUM_DESTRUCTOR(UGmodel); }

  UGmodel& UGmodel::operator=(const UGmodel& source) {
    if (this != &source) {
      DiscreteGraphicalModel::operator=(source);
      graph_ = source.graph_;
      GUM_OP_CPY(UGmodel);
    }

    return *this;
  }

  UGmodel& UGmodel::operator=(UGmodel&& source) {
    if (this != &source) {
      DiscreteGraphicalModel::operator=(std::move(source));
      graph_ = std::move(source.graph_);
      GUM_OP_MOV(UGmodel);
    }

    return *this;
  }

  bool UGmodel::hasSameStructure(const UGmodel& other) const {
    if (this == &other) return true;

    if (size() != other.size()) return false;

    if (sizeEdges() != other.sizeEdges()) return false;

    for (const auto& nid: nodes()) {
      if (!other.exists(variable(nid).name())) return false;
    }

    for (const auto& edge: edges()) {
      if (!other.edges().exists(Edge(other.idFromName(variable(edge.first()).name()),
                                     other.idFromName(variable(edge.second()).name()))))
        return false;
    }

    return true;
  }
}   // namespace gum
