aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
structuralConstraintPossibleEdges_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 StructuralConstraintPossibleEdges::setGraphAlone(const DiGraph& graph) {}
57
60 auto res = _PossibleEdges_possible_edges_.empty()
61 || _PossibleEdges_possible_edges_.exists(Edge(x, y));
62 return res;
63 }
64
67 return true;
68 }
69
73 || _PossibleEdges_possible_edges_.exists(Edge(y, x));
74 }
75
77 INLINE bool
79 return checkArcAdditionAlone(change.node1(), change.node2());
80 }
81
83 INLINE bool
85 return checkArcDeletionAlone(change.node1(), change.node2());
86 }
87
89 INLINE bool
91 return checkArcReversalAlone(change.node1(), change.node2());
92 }
93
95 INLINE bool
97 switch (change.type()) {
99 return checkArcAdditionAlone(change.node1(), change.node2());
100
102 return checkArcDeletionAlone(change.node1(), change.node2());
103
105 return checkArcReversalAlone(change.node1(), change.node2());
106
107 default :
108 GUM_ERROR(OperationNotAllowed,
109 "edge modifications are not "
110 "supported by StructuralConstraintPossibleEdges");
111 }
112 }
113
116
119
122
125
127 INLINE bool
129 switch (change.type()) {
131 return !checkArcAdditionAlone(change.node1(), change.node2());
132
133 case GraphChangeType::ARC_DELETION : return false;
134
136 return !checkArcAdditionAlone(change.node2(), change.node1());
137
138 default :
139 GUM_ERROR(OperationNotAllowed,
140 "edge modifications are not supported "
141 "by StructuralConstraintPossibleEdges");
142 }
143 }
144
148 }
149
151 INLINE void StructuralConstraintPossibleEdges::addEdge(const Edge& edge) {
153 }
154
156 INLINE void StructuralConstraintPossibleEdges::eraseEdge(const Edge& edge) {
158 }
159
163 }
164
165// include all the methods applicable to the whole class hierarchy
166# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintPossibleEdges
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.
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
bool isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
EdgeSet _PossibleEdges_possible_edges_
the PossibleEdges on which we perform checks
void addEdge(const Edge &edge)
assign a new forbidden 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)
void setEdges(const EdgeSet &set)
assign a set of forbidden arcs
const EdgeSet & edges() const
returns the set of mandatory arcs
void eraseEdge(const Edge &edge)
remove a forbidden arc
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
void modifyGraphAlone(const ArcAddition &change)
notify the constraint of a modification of the graph
#define GUM_ERROR(type, msg)
Definition exceptions.h:72
Set< Edge > EdgeSet
Some typdefs and define for shortcuts ...
Size NodeId
Type for node ids.
include the inlined functions if necessary
Definition CSVParser.h:54
gum is the global namespace for all aGrUM entities
Definition agrum.h:46