aGrUM 3.1.1
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-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#pragma once
42
43
60
62#ifndef DOXYGEN_SHOULD_SKIP_THIS
63
64namespace gum {
65
66 namespace learning {
67
69 INLINE void StructuralConstraintSliceOrder::setGraphAlone(const DiGraph& graph) {}
70
73 try {
75 } catch (const Exception&) { return true; }
76 }
77
80 return true;
81 }
82
85 try {
87 } catch (const Exception&) { return true; }
88 }
89
92 NodeId node2,
93 NodeId node3) const {
94 bool res = true;
95 try {
96 res = _SliceOrder_order_[node1] == _SliceOrder_order_[node2];
97 } catch (const Exception&) {}
98 try {
99 return res && _SliceOrder_order_[node1] == _SliceOrder_order_[node3];
100 } catch (const Exception&) { return true; }
101 return res;
102 }
103
106 NodeId node2,
107 NodeId node3) const {
108 try {
109 return _SliceOrder_order_[node2] == _SliceOrder_order_[node3];
110 } catch (const Exception&) { return true; }
111 }
112
115
118
121
123 INLINE void
125
127 INLINE void
129
132
134
136 INLINE bool
138 return checkArcAdditionAlone(change.node1(), change.node2());
139 }
140
142 INLINE bool
144 return checkArcDeletionAlone(change.node1(), change.node2());
145 }
146
148 INLINE bool
150 return checkArcReversalAlone(change.node1(), change.node2());
151 }
152
155 const ArcTriangleDeletion1& change) const {
156 return checkArcTriangleDeletion1Alone(change.node1(), change.node2(), change.node3());
157 }
158
161 const ArcTriangleDeletion2& change) const {
162 return checkArcTriangleDeletion2Alone(change.node1(), change.node2(), change.node3());
163 }
164
166
169 _SliceOrder_order_ = order;
170 }
171
174 for (auto& node: _SliceOrder_order_) {
175 node.second = slice;
176 }
177 }
178
180 INLINE void StructuralConstraintSliceOrder::addNode(NodeId node, NodeId slice) {
181 _SliceOrder_order_.set(node, slice);
182 }
183
186 return _SliceOrder_order_;
187 }
188
189// include all the methods applicable to the whole class hierarchy
190# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintSliceOrder
192# undef GUM_CONSTRAINT_CLASS_NAME
193
194 } /* namespace learning */
195
196} /* namespace gum */
197
198#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.
The graph change substituting a triangle node1->node2->node3 + node1->node3 into v-structure node2->n...
The graph change substituting a triangle node1->node2->node3 + node1->node3 into v-structure node1->n...
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
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)
const NodeProperty< NodeId > & sliceOrder() const
returns the current slice order
bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
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
Size NodeId
Type for node ids.
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
the structural constraint imposing a partial order over nodes