aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
structuralConstraintSliceOrder_inl.h
Go to the documentation of this file.
1/****************************************************************************
2 * This file is part of the aGrUM/pyAgrum library. *
3 * *
4 * Copyright (c) 2005-2025 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-2025 *
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#pragma once
41
42
59
60#ifndef DOXYGEN_SHOULD_SKIP_THIS
61
62namespace gum {
63
64 namespace learning {
65
67 INLINE void StructuralConstraintSliceOrder::setGraphAlone(const DiGraph& graph) {}
68
71 try {
73 } catch (const Exception&) { return true; }
74 }
75
78 return true;
79 }
80
83 try {
85 } catch (const Exception&) { return true; }
86 }
87
90
93
96
99
101 INLINE bool
103 switch (change.type()) {
105 try {
106 return (_SliceOrder_order_[change.node1()] > _SliceOrder_order_[change.node2()]);
107 } catch (const Exception&) { return false; }
108
109 case GraphChangeType::ARC_DELETION : return false;
110
112 try {
113 return (_SliceOrder_order_[change.node1()] != _SliceOrder_order_[change.node2()]);
114 } catch (const Exception&) { return false; }
115
116 default :
117 GUM_ERROR(OperationNotAllowed,
118 "edge modifications are not "
119 "supported by SliceOrder constraints");
120 }
121 }
122
124 INLINE bool
126 return checkArcAdditionAlone(change.node1(), change.node2());
127 }
128
130 INLINE bool
132 return checkArcDeletionAlone(change.node1(), change.node2());
133 }
134
136 INLINE bool
138 return checkArcReversalAlone(change.node1(), change.node2());
139 }
140
142 INLINE bool
144 switch (change.type()) {
146 return checkArcAdditionAlone(change.node1(), change.node2());
147
149 return checkArcDeletionAlone(change.node1(), change.node2());
150
152 return checkArcReversalAlone(change.node1(), change.node2());
153
154 default :
155 GUM_ERROR(OperationNotAllowed,
156 "edge modifications are not "
157 "supported by StructuralConstraintSliceOrder");
158 }
159 }
160
163 _SliceOrder_order_ = order;
164 }
165
168 for (auto& node: _SliceOrder_order_) {
169 node.second = slice;
170 }
171 }
172
174 INLINE void StructuralConstraintSliceOrder::addNode(NodeId node, NodeId slice) {
175 _SliceOrder_order_.set(node, slice);
176 }
177
180 return _SliceOrder_order_;
181 }
182
183// include all the methods applicable to the whole class hierarchy
184# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintSliceOrder
186# undef GUM_CONSTRAINT_CLASS_NAME
187
188 } /* namespace learning */
189
190} /* namespace gum */
191
192#endif /* DOXYGEN_SHOULD_SKIP_THIS */
The class for notifying learning algorithms of new arc additions.
The class for notifying learning algorithms of arc removals.
The class for notifying learning algorithms of arc reversals.
NodeProperty< NodeId > _SliceOrder_order_
slices to which belong the nodes
void modifyGraphAlone(const ArcAddition &change)
notify the constraint of a modification of the graph
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
void setDefaultSlice(NodeId slice)
assign a given slice to all the nodes specified in the partial order
bool checkModificationAlone(const ArcAddition &change) const
checks whether the constraints enable to add an arc
void setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checkings
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
const NodeProperty< NodeId > & sliceOrder() const
returns the current slice order
void setSliceOrder(const NodeProperty< NodeId > &slice)
sets the time slices of all the nodes in the property
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
void addNode(NodeId node, NodeId slice)
adds a new node in the slice order
#define GUM_ERROR(type, msg)
Definition exceptions.h:72
Size NodeId
Type for node ids.
HashTable< NodeId, VAL > NodeProperty
Property on graph elements.
include the inlined functions if necessary
Definition CSVParser.h:54
gum is the global namespace for all aGrUM entities
Definition agrum.h:46