aGrUM 3.1.1
a C++ library for (probabilistic) graphical models
structuralConstraintMandatoryArcs.cpp
Go to the documentation of this file.
1/****************************************************************************
2 * This file is part of the aGrUM/pyAgrum library. *
3 * *
4 * Copyright (c) 2005-2026 by *
5 * - Pierre-Henri WUILLEMIN(_at_LIP6) *
6 * - Christophe GONZALES(_at_AMU) *
7 * *
8 * The aGrUM/pyAgrum library is free software; you can redistribute it *
9 * and/or modify it under the terms of either : *
10 * *
11 * - the GNU Lesser General Public License as published by *
12 * the Free Software Foundation, either version 3 of the License, *
13 * or (at your option) any later version, *
14 * - the MIT license (MIT), *
15 * - or both in dual license, as here. *
16 * *
17 * (see https://agrum.gitlab.io/articles/dual-licenses-lgplv3mit.html) *
18 * *
19 * This aGrUM/pyAgrum library is distributed in the hope that it will be *
20 * useful, but WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, *
21 * INCLUDING BUT NOT LIMITED TO THE WARRANTIES MERCHANTABILITY or FITNESS *
22 * FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE *
23 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER *
24 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, *
25 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR *
26 * OTHER DEALINGS IN THE SOFTWARE. *
27 * *
28 * See LICENCES for more details. *
29 * *
30 * SPDX-FileCopyrightText: Copyright 2005-2026 *
31 * - Pierre-Henri WUILLEMIN(_at_LIP6) *
32 * - Christophe GONZALES(_at_AMU) *
33 * SPDX-License-Identifier: LGPL-3.0-or-later OR MIT *
34 * *
35 * Contact : info_at_agrum_dot_org *
36 * homepage : http://agrum.gitlab.io *
37 * gitlab : https://gitlab.com/agrumery/agrum *
38 * *
39 ****************************************************************************/
40
41
48
50
52#ifdef GUM_NO_INLINE
54#endif /* GUM_NO_INLINE */
55
56namespace gum {
57
58 namespace learning {
59
64
70
77
84
89
96
100 if (this != &from) {
101 _MandatoryArcs_mandatory_arcs_ = std::move(from._MandatoryArcs_mandatory_arcs_);
102 }
103 return *this;
104 }
105
106 bool
108 switch (change.type()) {
110 return checkArcAdditionAlone(change.node1(), change.node2());
111
113 return checkArcDeletionAlone(change.node1(), change.node2());
114
116 return checkArcReversalAlone(change.node1(), change.node2());
117
119 return checkArcTriangleDeletion1Alone(change.node1(), change.node2(), change.node3());
120
122 return checkArcTriangleDeletion2Alone(change.node1(), change.node2(), change.node3());
123
124 default :
126 "Graph change operation "
127 << change.typeAsString()
128 << " is not supported by the Mandatory Arcs structural constraint");
129 }
130 }
131
133 switch (change.type()) {
134 case GraphChangeType::ARC_ADDITION : return false;
135
137 return !checkArcDeletionAlone(change.node1(), change.node2());
138
140 return !checkArcReversalAlone(change.node1(), change.node2());
141
143 return !checkArcTriangleDeletion1Alone(change.node1(), change.node2(), change.node3());
144
146 return !checkArcTriangleDeletion2Alone(change.node1(), change.node2(), change.node3());
147
148 default :
150 "Graph change operation "
151 << change.typeAsString()
152 << " is not supported by the Mandatory Arcs structural constraint");
153 }
154 }
155 } /* namespace learning */
156
157} /* namespace gum */
Base class for all oriented graphs.
Definition diGraph.h:132
Exception : operation not allowed.
std::string typeAsString() const
returns a string corresponding to the type of the change
NodeId node1() const noexcept
returns the first node involved in the modification
GraphChangeType type() const noexcept
returns the type of the operation
NodeId node2() const noexcept
returns the second node involved in the modification
NodeId node3() const
returns the third node involved in the modification (if any)
the structural constraint indicating that some arcs shall never be removed or reversed
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
StructuralConstraintMandatoryArcs & operator=(const StructuralConstraintMandatoryArcs &from)
copy operator
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
ArcSet _MandatoryArcs_mandatory_arcs_
the MandatoryArcs on which we perform checks
bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
bool isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
bool checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
#define GUM_ERROR(type, msg)
Definition exceptions.h:76
include the inlined functions if necessary
Definition CSVParser.h:55
gum is the global namespace for all aGrUM entities
Definition agrum.h:46
STL namespace.
the structural constraint indicating that some arcs shall never be removed or reversed
the structural constraint indicating that some arcs shall never be removed or reversed