aGrUM 3.0.0
a C++ library for (probabilistic) graphical models
structuralConstraintTotalOrder_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
48
50#ifndef DOXYGEN_SHOULD_SKIP_THIS
51
52namespace gum {
53
54 namespace learning {
55
57 INLINE void StructuralConstraintTotalOrder::setGraphAlone(const DiGraph& graph) {}
58
61 try {
62 return _total_order_.pos(x) < _total_order_.pos(y);
63 } catch (const Exception&) { return true; }
64 }
65
68 return true;
69 }
70
73 try {
74 return _total_order_.pos(y) < _total_order_.pos(x);
75 } catch (const Exception&) { return true; }
76 }
77
80 NodeId node2,
81 NodeId node3) const {
82 bool res = true;
83 try {
84 res = _total_order_.pos(node2) < _total_order_.pos(node1);
85 } catch (const Exception&) {}
86 try {
87 return res && _total_order_.pos(node3) == _total_order_.pos(node1);
88 } catch (const Exception&) { return true; }
89 return res;
90 }
91
94 NodeId node2,
95 NodeId node3) const {
96 try {
97 return _total_order_.pos(node3) < _total_order_.pos(node2);
98 } catch (const Exception&) { return true; }
99 }
100
103
106
109
111 INLINE void
113
115 INLINE void
117
120
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
143 const ArcTriangleDeletion1& change) const {
144 return checkArcTriangleDeletion1Alone(change.node1(), change.node2(), change.node3());
145 }
146
149 const ArcTriangleDeletion2& change) const {
150 return checkArcTriangleDeletion2Alone(change.node1(), change.node2(), change.node3());
151 }
152
154
156 INLINE void StructuralConstraintTotalOrder::setTotalOrder(const Sequence< NodeId >& order) {
157 _total_order_ = order;
158 }
159
161 INLINE const Sequence< NodeId >& StructuralConstraintTotalOrder::totalOrder() const {
162 return _total_order_;
163 }
164
165// include all the methods applicable to the whole class hierarchy
166# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintTotalOrder
168# undef GUM_CONSTRAINT_CLASS_NAME
169
170 } /* namespace learning */
171
172} /* namespace gum */
173
174#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...
Sequence< NodeId > _total_order_
the total ordering over the nodes
bool checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
void setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checkings
void setTotalOrder(const Sequence< NodeId > &Total)
sets the Total order of all the nodes in the property
bool checkModificationAlone(const ArcAddition &change) const
checks whether the constraints enable to add an arc
const Sequence< NodeId > & totalOrder() const
returns the current Total order
void modifyGraphAlone(const ArcAddition &change)
notify the constraint of a modification of the graph
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
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)
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
Size NodeId
Type for node ids.
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 total ordering over some nodes