aGrUM 3.0.0
a C++ library for (probabilistic) graphical models
structuralConstraintTotalOrder.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
47#ifndef GUM_LEARNING_STRUCTURAL_CONSTRAINT_TOTAL_ORDER_H
48#define GUM_LEARNING_STRUCTURAL_CONSTRAINT_TOTAL_ORDER_H
49
50#include <agrum/agrum.h>
51
53
54namespace gum {
55
56 namespace learning {
57
68 public:
69 // ##########################################################################
71 // ##########################################################################
73
76
78
80
83
86
89
92
94
95 // ##########################################################################
97 // ##########################################################################
99
102
105
107
108 // ##########################################################################
110 // ##########################################################################
112
115
118
121
123
129 void modifyGraphAlone(const ArcAddition& change);
130
132
134 void modifyGraphAlone(const ArcDeletion& change);
135
137
143 void modifyGraphAlone(const ArcReversal& change);
144
146
150
152
156
158
164 void modifyGraphAlone(const GraphChange& change);
165
167
180 bool isAlwaysInvalidAlone(const GraphChange& change) const;
181
183
187
189
191
193
196
198
201 bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const;
202
204
207 bool checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const;
208
209
211
214 bool checkModificationAlone(const ArcAddition& change) const;
215
217
218 bool checkModificationAlone(const ArcDeletion& change) const;
219
221
223 bool checkModificationAlone(const ArcReversal& change) const;
224
226
230
232
236
238
244 bool checkModificationAlone(const GraphChange& change) const;
245
247
248#ifndef DOXYGEN_SHOULD_SKIP_THIS
249// include the set of methods that enable the structural constraint to
250// be standalone, i.e., that it needs not be included into a
251// StructuralConstraintSetStatic to be used by learning algorithms
252# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintTotalOrder
254# undef GUM_CONSTRAINT_CLASS_NAME
255#endif // DOXYGEN_SHOULD_SKIP_THIS
256
257 protected:
260 };
261
262 } /* namespace learning */
263
264} /* namespace gum */
265
267#ifndef GUM_NO_INLINE
269#endif /* GUM_NO_INLINE */
270
271#endif /* GUM_LEARNING_STRUCTURAL_CONSTRAINT_TOTAL_ORDER_H */
Base class for all oriented graphs.
Definition diGraph.h:132
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 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
void setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checkings
bool checkModificationAlone(const ArcTriangleDeletion2 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
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
bool checkModificationAlone(const ArcTriangleDeletion1 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
const Sequence< NodeId > & totalOrder() const
returns the current Total order
void modifyGraphAlone(const ArcAddition &change)
notify the constraint of a modification of the graph
void modifyGraphAlone(const ArcTriangleDeletion1 &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 checkModificationAlone(const ArcReversal &change) const
checks whether the constraints enable to reverse an arc
void modifyGraphAlone(const GraphChange &change)
notify the constraint of a modification of the graph
bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
StructuralConstraintTotalOrder & operator=(const StructuralConstraintTotalOrder &from)
copy operator
void modifyGraphAlone(const ArcTriangleDeletion2 &change)
notify the constraint of a modification of the graph
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
void modifyGraphAlone(const ArcReversal &change)
notify the constraint of a modification of the graph
bool checkModificationAlone(const ArcDeletion &change) const
checks whether the constraints enable to remove an arc
void modifyGraphAlone(const ArcDeletion &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)
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 base class for all structural constraints
the structural constraint imposing a total order over some nodes
the base class for all structural constraints