48#ifndef DOXYGEN_SHOULD_SKIP_THIS
64 for (
auto node: graph)
65 g.addNodeWithId(node);
67 for (
auto& arc: graph.arcs())
68 g.addArc(arc.tail(), arc.head());
77 for (
NodeId i = 0; i < nb_nodes; ++i) {
116 switch (change.type()) {
128 "edge modifications are not "
129 "supported by StructuralConstraintDAG");
150 switch (change.type()) {
164 GUM_ERROR(OperationNotAllowed,
"edge modifications are not supported by DAG constraints")
175 constraints::setGraph(graph);
186# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintDAG
188# undef GUM_CONSTRAINT_CLASS_NAME
A class for detecting directed cycles in DAGs when trying to apply many changes to the graph.
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 isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
void setGraph(const DAG &graph)
sets a new graph from which we will perform checkings
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)
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
DAGCycleDetector _DAG_cycle_detector_
the cycle detector used to check quickly graph modifications
bool checkArcDeletionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to remove arc (x,y)
void setGraph(Size nb_nodes)
sets a new empty graph from which we will perform checkings
#define GUM_ERROR(type, msg)
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 used by learning algorithms that learn a directed graph str...