aGrUM 3.1.1
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-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
51#ifndef DOXYGEN_SHOULD_SKIP_THIS
52
53namespace gum {
54
55 namespace learning {
56
58 INLINE void StructuralConstraintPossibleEdges::setGraphAlone(const DiGraph& graph) {}
59
62 auto res = _PossibleEdges_possible_edges_.empty()
63 || _PossibleEdges_possible_edges_.exists(Edge(x, y));
64 return res;
65 }
66
69 return true;
70 }
71
75 || _PossibleEdges_possible_edges_.exists(Edge(y, x));
76 }
77
79 INLINE bool
81 NodeId node2,
82 NodeId node3) const {
84 || (_PossibleEdges_possible_edges_.exists(Edge(node2, node1))
85 && _PossibleEdges_possible_edges_.exists(Edge(node3, node1)));
86 }
87
89 INLINE bool
91 NodeId node2,
92 NodeId node3) const {
94 || _PossibleEdges_possible_edges_.exists(Edge(node3, node1));
95 }
96
98 INLINE bool
100 return checkArcAdditionAlone(change.node1(), change.node2());
101 }
102
104 INLINE bool
106 return checkArcDeletionAlone(change.node1(), change.node2());
107 }
108
110 INLINE bool
112 return checkArcReversalAlone(change.node1(), change.node2());
113 }
114
117 const ArcTriangleDeletion1& change) const {
118 return checkArcTriangleDeletion1Alone(change.node1(), change.node2(), change.node3());
119 }
120
123 const ArcTriangleDeletion2& change) const {
124 return checkArcTriangleDeletion2Alone(change.node1(), change.node2(), change.node3());
125 }
126
128
131
134
137
140
142 INLINE void
144
146 INLINE void
148
150
154 }
155
157 INLINE void StructuralConstraintPossibleEdges::addEdge(const Edge& edge) {
159 }
160
162 INLINE void StructuralConstraintPossibleEdges::eraseEdge(const Edge& edge) {
164 }
165
169 }
170
171// include all the methods applicable to the whole class hierarchy
172# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintPossibleEdges
174# undef GUM_CONSTRAINT_CLASS_NAME
175
176 } /* namespace learning */
177
178} /* namespace gum */
179
180#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 checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
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 checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
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
bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
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
Set< Edge > EdgeSet
Some typdefs and define for shortcuts ...
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 for forbidding the creation of some arcs during structure learning