48#ifndef GUM_LEARNING_STRUCTURAL_CONSTRAINT_POSSIBLE_EDGES_H
49#define GUM_LEARNING_STRUCTURAL_CONSTRAINT_POSSIBLE_EDGES_H
238#ifndef DOXYGEN_SHOULD_SKIP_THIS
242# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintPossibleEdges
244# undef GUM_CONSTRAINT_CLASS_NAME
Base class for all oriented graphs.
The base class for all undirected edges.
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 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
void modifyGraphAlone(const GraphChange &change)
notify the constraint of a modification of the graph
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
bool isAlwaysInvalidAlone(const GraphChange &change) const
indicates whether a change will always violate the constraint
bool checkModificationAlone(const ArcDeletion &change) const
checks whether the constraints enable to remove an arc
void modifyGraphAlone(const ArcTriangleDeletion1 &change)
notify the constraint of a modification of the graph
bool checkModificationAlone(const GraphChange &change) const
checks whether the constraints enable to perform a graph change
bool checkModificationAlone(const ArcAddition &change) const
checks whether the constraints enable to add an arc
EdgeSet _PossibleEdges_possible_edges_
the PossibleEdges on which we perform checks
void addEdge(const Edge &edge)
assign a new forbidden arc
virtual ~StructuralConstraintPossibleEdges()
destructor
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
StructuralConstraintPossibleEdges & operator=(const StructuralConstraintPossibleEdges &from)
copy operator
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
bool checkModificationAlone(const ArcTriangleDeletion2 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
bool checkModificationAlone(const ArcTriangleDeletion1 &change) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
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
StructuralConstraintPossibleEdges()
default constructor
void modifyGraphAlone(const ArcTriangleDeletion2 &change)
notify the constraint of a modification of the graph
void modifyGraphAlone(const ArcReversal &change)
notify the constraint of a modification of the graph
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
gum is the global namespace for all aGrUM entities
the base class for all structural constraints
the structural constraint for forbidding the creation of some arcs during structure learning
the base class for all structural constraints