aGrUM  0.16.0
structuralConstraintPossibleEdges.h
Go to the documentation of this file.
1 
29 #ifndef GUM_LEARNING_STRUCTURAL_CONSTRAINT_POSSIBLE_EDGES_H
30 #define GUM_LEARNING_STRUCTURAL_CONSTRAINT_POSSIBLE_EDGES_H
31 
32 #include <agrum/agrum.h>
33 #include <agrum/graphs/diGraph.h>
36 
37 namespace gum {
38 
39  namespace learning {
40 
47  : public virtual StructuralConstraintEmpty {
48  public:
49  // ##########################################################################
51  // ##########################################################################
53 
56 
59 
63 
66 
69 
71 
72  // ##########################################################################
74  // ##########################################################################
76 
80 
84 
86 
87  // ##########################################################################
89  // ##########################################################################
91 
93  void setEdges(const EdgeSet& set);
94 
96  void addEdge(const Edge& edge);
97 
99  void eraseEdge(const Edge& edge);
100 
102  const EdgeSet& edges() const;
103 
105  void setGraphAlone(const DiGraph& graph);
106 
108 
112  void modifyGraphAlone(const ArcAddition& change);
113 
115 
117  void modifyGraphAlone(const ArcDeletion& change);
118 
120 
124  void modifyGraphAlone(const ArcReversal& change);
125 
127 
131  void modifyGraphAlone(const GraphChange& change);
132 
134 
147  bool isAlwaysInvalidAlone(const GraphChange& change) const;
148 
150 
152  bool checkArcAdditionAlone(NodeId x, NodeId y) const;
153 
155 
156  bool checkArcDeletionAlone(NodeId x, NodeId y) const;
157 
159 
161  bool checkArcReversalAlone(NodeId x, NodeId y) const;
162 
164 
169  bool checkModificationAlone(const GraphChange& change) const;
170 
172 
174  bool checkModificationAlone(const ArcAddition& change) const;
175 
177 
178  bool checkModificationAlone(const ArcDeletion& change) const;
179 
181 
183  bool checkModificationAlone(const ArcReversal& change) const;
184 
186 
187 #ifndef DOXYGEN_SHOULD_SKIP_THIS
188 // include the set of methods that enable the structural constraint to
189 // be standalone, i.e., that it needs not be included into a
190 // StructuralConstraintSetStatic to be used by learning algorithms
191 # define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintPossibleEdges
193 # undef GUM_CONSTRAINT_CLASS_NAME
194 #endif // DOXYGEN_SHOULD_SKIP_THIS
195 
196  protected:
199  };
200 
201  } /* namespace learning */
202 
203 } /* namespace gum */
204 
206 #ifndef GUM_NO_INLINE
208 #endif /* GUM_NO_INLINE */
209 
210 #endif /* GUM_LEARNING_STRUCTURAL_CONSTRAINT_POSSIBLE_EDGES_H */
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
void addEdge(const Edge &edge)
assign a new forbidden arc
void setEdges(const EdgeSet &set)
assign a set of forbidden arcs
void setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checkings
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
The class for notifying learning algorithms of new arc additionsThis class is convenient to know at c...
Definition: graphChange.h:150
EdgeSet _PossibleEdges__possible_edges
the PossibleEdges on which we perform checks
the structural constraint for forbidding the creation of some arcs except those defined in the class ...
The class for notifying learning algorithms of arc removalsThis class is convenient to know at compil...
Definition: graphChange.h:216
the base class for all structural constraints
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Definition: agrum.h:25
void modifyGraphAlone(const ArcAddition &change)
notify the constraint of a modification of the graph
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
StructuralConstraintPossibleEdges & operator=(const StructuralConstraintPossibleEdges &from)
copy operator
Base class for all oriented graphs.
Definition: diGraph.h:111
const EdgeSet & edges() const
returns the set of mandatory arcs
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
The base class for all undirected edges.
void eraseEdge(const Edge &edge)
remove a forbidden arc
The class for notifying learning algorithms of arc reversalsThis class is convenient to know at compi...
Definition: graphChange.h:282
bool isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
Size NodeId
Type for node ids.
Definition: graphElements.h:98