29 #ifndef GUM_LEARNING_STRUCTURAL_CONSTRAINT_UNDIGRAPH_H 30 #define GUM_LEARNING_STRUCTURAL_CONSTRAINT_UNDIGRAPH_H 165 #ifndef DOXYGEN_SHOULD_SKIP_THIS 169 # define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintUndiGraph 171 # undef GUM_CONSTRAINT_CLASS_NAME 172 #endif // DOXYGEN_SHOULD_SKIP_THIS 184 #ifndef GUM_NO_INLINE void setGraphAlone(const UndiGraph &graph)
sets a new graph from which we will perform checkings
UndiGraph _UndiGraph__graph
the UndiGraph on which we perform checks
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
bool isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
the base class for all structural constraints
StructuralConstraintUndiGraph & operator=(const StructuralConstraintUndiGraph &from)
copy operator
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.
The class for notifying learning algorithms of edge removalsThis class is convenient to know at compi...
The class for notifying learning algorithms of new edge additionsThis class is convenient to know at ...
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
The base class for structural constraints used by learning algorithms that learn an undirected graph ...
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
void setGraph(Size nb_nodes)
sets a new empty graph from which we will perform checkings
bool checkEdgeDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove edge (x,y)
StructuralConstraintUndiGraph()
default constructor
Base class for undirected graphs.
virtual ~StructuralConstraintUndiGraph()
destructor
void modifyGraphAlone(const EdgeAddition &change)
notify the constraint of a modification of the graph
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Size NodeId
Type for node ids.
bool checkEdgeAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add edge (x,y)