aGrUM 3.1.1
a C++ library for (probabilistic) graphical models
structuralConstraintSliceOrder.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
58
60
62#ifdef GUM_NO_INLINE
64#endif /* GUM_NO_INLINE */
65
66namespace gum {
67
68 namespace learning {
69
74
77 const NodeProperty< NodeId >& order) {
78 for (auto iter = order.cbegin(); iter != order.cend(); ++iter) {
79 _graph_.addNodeWithId(iter.key());
80 }
81 _SliceOrder_order_ = order;
82
83 GUM_CONSTRUCTOR(StructuralConstraintSliceOrder);
84 }
85
93
100
108
113
123
127 if (this != &from) {
129 _SliceOrder_order_ = std::move(from._SliceOrder_order_);
130 }
131 return *this;
132 }
133
135 switch (change.type()) {
137 return !checkArcAdditionAlone(change.node1(), change.node2());
138
139 case GraphChangeType::ARC_DELETION : return false;
140
142 return !checkArcAdditionAlone(change.node2(), change.node1());
143
145 return !checkArcTriangleDeletion1Alone(change.node1(), change.node2(), change.node3());
146
148 return !checkArcTriangleDeletion2Alone(change.node1(), change.node2(), change.node3());
149
150 default :
152 "Graph change operation "
153 << change.typeAsString()
154 << " is not supported by the SliceOrder structural constraint");
155 }
156 }
157
159 switch (change.type()) {
161 return checkArcAdditionAlone(change.node1(), change.node2());
162
164 return checkArcDeletionAlone(change.node1(), change.node2());
165
167 return checkArcReversalAlone(change.node1(), change.node2());
168
170 return checkArcTriangleDeletion1Alone(change.node1(), change.node2(), change.node3());
171
173 return checkArcTriangleDeletion2Alone(change.node1(), change.node2(), change.node3());
174
175 default :
177 "edge modifications are not "
178 "supported by the Slice Order structural constraint");
179 }
180 }
181 } /* namespace learning */
182
183} /* namespace gum */
Base class for all oriented graphs.
Definition diGraph.h:132
const const_iterator & cend() const noexcept
Returns the unsafe const_iterator pointing to the end of the hashtable.
const_iterator cbegin() const
Returns an unsafe const_iterator pointing to the beginning of the hashtable.
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 base class for structural constraints used by learning algorithms that learn a directed graph str...
StructuralConstraintDiGraph & operator=(const StructuralConstraintDiGraph &from)
copy operator
the structural constraint imposing a partial order over nodes
bool checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
NodeProperty< NodeId > _SliceOrder_order_
slices to which belong the nodes
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
bool checkModificationAlone(const ArcAddition &change) const
checks whether the constraints enable to add an arc
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
bool isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
StructuralConstraintSliceOrder & operator=(const StructuralConstraintSliceOrder &from)
copy operator
bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
#define GUM_ERROR(type, msg)
Definition exceptions.h:76
HashTable< NodeId, VAL > NodeProperty
Property on graph elements.
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 imposing a partial order over nodes
the structural constraint imposing a partial order over nodes