aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
structuralConstraintForbiddenArcs_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
49#ifndef DOXYGEN_SHOULD_SKIP_THIS
50
51namespace gum {
52
53 namespace learning {
54
56 INLINE void StructuralConstraintForbiddenArcs::setGraphAlone(const DiGraph& graph) {}
57
60 return !_ForbiddenArcs_forbidden_arcs_.exists(Arc(x, y));
61 }
62
65 return true;
66 }
67
70 return !_ForbiddenArcs_forbidden_arcs_.exists(Arc(y, x));
71 }
72
74 INLINE bool
76 return checkArcAdditionAlone(change.node1(), change.node2());
77 }
78
80 INLINE bool
82 return checkArcDeletionAlone(change.node1(), change.node2());
83 }
84
86 INLINE bool
88 return checkArcReversalAlone(change.node1(), change.node2());
89 }
90
92 INLINE bool
94 switch (change.type()) {
96 return checkArcAdditionAlone(change.node1(), change.node2());
97
99 return checkArcDeletionAlone(change.node1(), change.node2());
100
102 return checkArcReversalAlone(change.node1(), change.node2());
103
104 default :
105 GUM_ERROR(OperationNotAllowed,
106 "edge modifications are not "
107 "supported by StructuralConstraintForbiddenArcs");
108 }
109 }
110
113
116
119
122
124 INLINE bool
126 switch (change.type()) {
128 return !checkArcAdditionAlone(change.node1(), change.node2());
129
130 case GraphChangeType::ARC_DELETION : return false;
131
133 return !checkArcAdditionAlone(change.node2(), change.node1());
134
135 default :
136 GUM_ERROR(OperationNotAllowed,
137 "edge modifications are not supported "
138 "by StructuralConstraintForbiddenArcs");
139 }
140 }
141
143 INLINE void StructuralConstraintForbiddenArcs::setArcs(const ArcSet& set) {
145 }
146
148 INLINE void StructuralConstraintForbiddenArcs::addArc(const Arc& arc) {
150 }
151
153 INLINE void StructuralConstraintForbiddenArcs::eraseArc(const Arc& arc) {
155 }
156
158 INLINE const ArcSet& StructuralConstraintForbiddenArcs::arcs() const {
160 }
161
162// include all the methods applicable to the whole class hierarchy
163# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintForbiddenArcs
165# undef GUM_CONSTRAINT_CLASS_NAME
166
167 } /* namespace learning */
168
169} /* namespace gum */
170
171#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.
void setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checkings
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
ArcSet _ForbiddenArcs_forbidden_arcs_
the ForbiddenArcs on which we perform checks
void addArc(const Arc &arc)
assign a new forbidden arc
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
const ArcSet & arcs() const
returns the set of mandatory arcs
void modifyGraphAlone(const ArcAddition &change)
notify the constraint of a modification of the graph
bool isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
void eraseArc(const Arc &arc)
remove a forbidden arc
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
void setArcs(const ArcSet &set)
assign a set of forbidden arcs
#define GUM_ERROR(type, msg)
Definition exceptions.h:72
Size NodeId
Type for node ids.
Set< Arc > ArcSet
Some typdefs and define for shortcuts ...
include the inlined functions if necessary
Definition CSVParser.h:54
gum is the global namespace for all aGrUM entities
Definition agrum.h:46