47#ifndef GUM_LEARNING_STRUCTURAL_CONSTRAINT_DAG_H
48#define GUM_LEARNING_STRUCTURAL_CONSTRAINT_DAG_H
216#ifndef DOXYGEN_SHOULD_SKIP_THIS
220# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintDAG
222# undef GUM_CONSTRAINT_CLASS_NAME
A class for detecting directed cycles in DAGs when trying to apply many changes to the graph.
A class for detecting directed cycles in DAGs when trying to apply many changes to the graph.
Base class for all oriented graphs.
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 modifyGraphAlone(const GraphChange &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
virtual ~StructuralConstraintDAG()
destructor
StructuralConstraintDAG & operator=(const StructuralConstraintDAG &from)
copy operator
bool checkModificationAlone(const ArcDeletion &change) const
checks whether the constraints enable to remove an arc
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
void setGraph(const DAG &graph)
sets a new graph from which we will perform checkings
void modifyGraphAlone(const ArcReversal &change)
notify the constraint of a modification of the graph
void modifyGraphAlone(const ArcAddition &change)
notify the constraint of a modification of the graph
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
StructuralConstraintDAG()
default constructor
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
bool checkModificationAlone(const ArcAddition &change) const
checks whether the constraints enable to add an arc
void setGraphAlone(const DiGraph &graph)
sets a new graph from which we will perform checkings
void setGraphAlone(Size nb_nodes)
sets a new empty graph from which we will perform checkings
DAGCycleDetector _DAG_cycle_detector_
the cycle detector used to check quickly graph modifications
void setGraph(Size nb_nodes)
sets a new empty graph from which we will perform checkings
bool checkModificationAlone(const ArcReversal &change) const
checks whether the constraints enable to reverse an arc
void modifyGraphAlone(const ArcDeletion &change)
notify the constraint of a modification of the graph
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
StructuralConstraintSetStatic()
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Size NodeId
Type for node ids.
include the inlined functions if necessary
gum is the global namespace for all aGrUM entities
the base class for structural constraints imposed by DAGs
the base class for structural constraints used by learning algorithms that learn a directed graph str...