62#ifndef DOXYGEN_SHOULD_SKIP_THIS
75 }
catch (
const Exception&) {
return true; }
87 }
catch (
const Exception&) {
return true; }
97 }
catch (
const Exception&) {}
100 }
catch (
const Exception&) {
return true; }
110 }
catch (
const Exception&) {
return true; }
190# define GUM_CONSTRAINT_CLASS_NAME StructuralConstraintSliceOrder
192# undef GUM_CONSTRAINT_CLASS_NAME
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 checkArcTriangleDeletion2Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion2
NodeProperty< NodeId > _SliceOrder_order_
slices to which belong the nodes
void modifyGraphAlone(const ArcAddition &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)
void setDefaultSlice(NodeId slice)
assign a given slice to all the nodes specified in the partial order
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
bool checkArcAdditionAlone(NodeId x, NodeId y) const
checks whether the constraints enable to add arc (x,y)
const NodeProperty< NodeId > & sliceOrder() const
returns the current slice order
bool checkArcTriangleDeletion1Alone(NodeId node1, NodeId node2, NodeId node3) const
checks whether the constraints enable to apply an ArcTriangleDeletion1
void setSliceOrder(const NodeProperty< NodeId > &slice)
sets the time slices of all the nodes in the property
bool checkArcReversalAlone(NodeId x, NodeId y) const
checks whether the constraints enable to reverse arc (x,y)
void addNode(NodeId node, NodeId slice)
adds a new node in the slice order
Size NodeId
Type for node ids.
HashTable< NodeId, VAL > NodeProperty
Property on graph elements.
include the inlined functions if necessary
gum is the global namespace for all aGrUM entities
the structural constraint imposing a partial order over nodes