aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
gum::learning::StructuralConstraintForbiddenArcs Class Reference

the structural constraint for forbidding the creation of some arcs during structure learning More...

#include <structuralConstraintForbiddenArcs.h>

Inheritance diagram for gum::learning::StructuralConstraintForbiddenArcs:
Collaboration diagram for gum::learning::StructuralConstraintForbiddenArcs:

Public Types

using allConstraints = _ConstraintSet_< void >

Public Member Functions

Constructors / Destructors
 StructuralConstraintForbiddenArcs ()
 default constructor
 StructuralConstraintForbiddenArcs (const DiGraph &graph)
 constructor starting with a given graph
 StructuralConstraintForbiddenArcs (const StructuralConstraintForbiddenArcs &from)
 copy constructor
 StructuralConstraintForbiddenArcs (StructuralConstraintForbiddenArcs &&from)
 move constructor
virtual ~StructuralConstraintForbiddenArcs ()
 destructor
Operators
StructuralConstraintForbiddenArcsoperator= (const StructuralConstraintForbiddenArcs &from)
 copy operator
StructuralConstraintForbiddenArcsoperator= (StructuralConstraintForbiddenArcs &&from)
 move operator
Specific Accessors / Modifiers
void setArcs (const ArcSet &set)
 assign a set of forbidden arcs
void addArc (const Arc &arc)
 assign a new forbidden arc
void eraseArc (const Arc &arc)
 remove a forbidden arc
const ArcSetarcs () const
 returns the set of mandatory arcs
void setGraphAlone (const DiGraph &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
void modifyGraphAlone (const ArcDeletion &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 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
bool checkArcAdditionAlone (NodeId x, NodeId y) const
 checks whether the constraints enable to add arc (x,y)
bool checkArcDeletionAlone (NodeId x, NodeId y) const
 checks whether the constraints enable to remove arc (x,y)
bool checkArcReversalAlone (NodeId x, NodeId y) const
 checks whether the constraints enable to reverse arc (x,y)
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
bool checkModificationAlone (const ArcDeletion &change) const
 checks whether the constraints enable to remove an arc
bool checkModificationAlone (const ArcReversal &change) const
 checks whether the constraints enable to reverse an arc

Protected Attributes

ArcSet _ForbiddenArcs_forbidden_arcs_
 the ForbiddenArcs on which we perform checks

Detailed Description

the structural constraint for forbidding the creation of some arcs during structure learning

Definition at line 64 of file structuralConstraintForbiddenArcs.h.

Member Typedef Documentation

◆ allConstraints

using gum::learning::StructuralConstraintEmpty::allConstraints = _ConstraintSet_< void >
inherited

Definition at line 61 of file structuralConstraint.h.

Constructor & Destructor Documentation

◆ StructuralConstraintForbiddenArcs() [1/4]

gum::learning::StructuralConstraintForbiddenArcs::StructuralConstraintForbiddenArcs ( )

default constructor

Definition at line 61 of file structuralConstraintForbiddenArcs.cpp.

References StructuralConstraintForbiddenArcs().

Referenced by StructuralConstraintForbiddenArcs(), StructuralConstraintForbiddenArcs(), StructuralConstraintForbiddenArcs(), StructuralConstraintForbiddenArcs(), ~StructuralConstraintForbiddenArcs(), operator=(), and operator=().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ StructuralConstraintForbiddenArcs() [2/4]

gum::learning::StructuralConstraintForbiddenArcs::StructuralConstraintForbiddenArcs ( const DiGraph & graph)

constructor starting with a given graph

Definition at line 66 of file structuralConstraintForbiddenArcs.cpp.

66 {
67 setGraph(graph);
68 GUM_CONSTRUCTOR(StructuralConstraintForbiddenArcs);
69 }

References StructuralConstraintForbiddenArcs().

Here is the call graph for this function:

◆ StructuralConstraintForbiddenArcs() [3/4]

gum::learning::StructuralConstraintForbiddenArcs::StructuralConstraintForbiddenArcs ( const StructuralConstraintForbiddenArcs & from)

copy constructor

Definition at line 72 of file structuralConstraintForbiddenArcs.cpp.

73 :
74 _ForbiddenArcs_forbidden_arcs_(from._ForbiddenArcs_forbidden_arcs_) {
76 }
ArcSet _ForbiddenArcs_forbidden_arcs_
the ForbiddenArcs on which we perform checks

References StructuralConstraintForbiddenArcs(), and _ForbiddenArcs_forbidden_arcs_.

Here is the call graph for this function:

◆ StructuralConstraintForbiddenArcs() [4/4]

gum::learning::StructuralConstraintForbiddenArcs::StructuralConstraintForbiddenArcs ( StructuralConstraintForbiddenArcs && from)

move constructor

Definition at line 79 of file structuralConstraintForbiddenArcs.cpp.

80 :
81 _ForbiddenArcs_forbidden_arcs_(std::move(from._ForbiddenArcs_forbidden_arcs_)) {
83 }

References StructuralConstraintForbiddenArcs(), and _ForbiddenArcs_forbidden_arcs_.

Here is the call graph for this function:

◆ ~StructuralConstraintForbiddenArcs()

gum::learning::StructuralConstraintForbiddenArcs::~StructuralConstraintForbiddenArcs ( )
virtual

destructor

Definition at line 86 of file structuralConstraintForbiddenArcs.cpp.

86 {
88 }

References StructuralConstraintForbiddenArcs().

Here is the call graph for this function:

Member Function Documentation

◆ addArc()

void gum::learning::StructuralConstraintForbiddenArcs::addArc ( const Arc & arc)

assign a new forbidden arc

◆ arcs()

const ArcSet & gum::learning::StructuralConstraintForbiddenArcs::arcs ( ) const

returns the set of mandatory arcs

◆ checkArcAdditionAlone()

bool gum::learning::StructuralConstraintForbiddenArcs::checkArcAdditionAlone ( NodeId x,
NodeId y ) const

checks whether the constraints enable to add arc (x,y)

an arc can be added if and only if its extremal nodes belong to the graph and the arc does not already exist.

◆ checkArcDeletionAlone()

bool gum::learning::StructuralConstraintForbiddenArcs::checkArcDeletionAlone ( NodeId x,
NodeId y ) const

checks whether the constraints enable to remove arc (x,y)

an arc can be removed if and only if the arc exists.

◆ checkArcReversalAlone()

bool gum::learning::StructuralConstraintForbiddenArcs::checkArcReversalAlone ( NodeId x,
NodeId y ) const

checks whether the constraints enable to reverse arc (x,y)

an arc can be reversed if and only if it exists and arc (y,x) does not.

◆ checkModificationAlone() [1/4]

bool gum::learning::StructuralConstraintForbiddenArcs::checkModificationAlone ( const ArcAddition & change) const

checks whether the constraints enable to add an arc

an arc can be added if and only if its extremal nodes belong to the graph and the arc does not already exist.

◆ checkModificationAlone() [2/4]

bool gum::learning::StructuralConstraintForbiddenArcs::checkModificationAlone ( const ArcDeletion & change) const

checks whether the constraints enable to remove an arc

an arc can be removed if and only if the arc exists.

◆ checkModificationAlone() [3/4]

bool gum::learning::StructuralConstraintForbiddenArcs::checkModificationAlone ( const ArcReversal & change) const

checks whether the constraints enable to reverse an arc

an arc (x,y) can be reversed if and only if it exists and arc (y,x) does not.

◆ checkModificationAlone() [4/4]

bool gum::learning::StructuralConstraintForbiddenArcs::checkModificationAlone ( const GraphChange & change) const

checks whether the constraints enable to perform a graph change

An arc can be added if and only if its extremal nodes belong to the graph and the arc does not already exist. An arc can be removed if and only if the arc exists. An arc (x,y) can be reversed if and only if it exists and arc (y,x) does not.

◆ eraseArc()

void gum::learning::StructuralConstraintForbiddenArcs::eraseArc ( const Arc & arc)

remove a forbidden arc

◆ isAlwaysInvalidAlone()

bool gum::learning::StructuralConstraintForbiddenArcs::isAlwaysInvalidAlone ( const GraphChange & change) const

indicates whether a change will always violate the constraint

Some learning algorithms need examine several times whether a given graph change can be applied. For instance, the first time arc (X,Y) addition is considered, the learning algorithm may discard this change because it violates the structural constraint (e.g., if the latter enforces a DAG structure, this arc addition might induce a directed cycle), but, later on, other arc removal may induce that the arc addition is now possible. Such change is thus not always invalid. Conversely, there are changes that can be discarded once and for all. For instance, in a 2TBN structure, it is always impossible to add a backward-time arc. Such graph changes are always invalid and are therefore tagged as such by the isAlwaysInvalid method.

◆ modifyGraphAlone() [1/4]

void gum::learning::StructuralConstraintForbiddenArcs::modifyGraphAlone ( const ArcAddition & change)

notify the constraint of a modification of the graph

Warning
If an already existing arc is added nothing is done. In particular, no exception is raised.
Exceptions
InvalidNodeexception is thrown if an arc (x,y) is added and x or y does not belong to the graph nodes

◆ modifyGraphAlone() [2/4]

void gum::learning::StructuralConstraintForbiddenArcs::modifyGraphAlone ( const ArcDeletion & change)

notify the constraint of a modification of the graph

Warning
If a nonexisting arc is removed, nothing is done. In particular, no exception is raised.

◆ modifyGraphAlone() [3/4]

void gum::learning::StructuralConstraintForbiddenArcs::modifyGraphAlone ( const ArcReversal & change)

notify the constraint of a modification of the graph

Warning
If an already existing arc is added, or if a nonexisting arc is removed, nothing is done. In particular, no exception is raised.
Exceptions
InvalidNodeexception is thrown if at least one extremity of the arc does not belong to the graph nodes

◆ modifyGraphAlone() [4/4]

void gum::learning::StructuralConstraintForbiddenArcs::modifyGraphAlone ( const GraphChange & change)

notify the constraint of a modification of the graph

Warning
If an already existing arc is added, or if a nonexisting arc is removed, nothing is done. In particular, no exception is raised.
Exceptions
InvalidNodeexception is thrown if an arc (x,y) is added and x or y does not belong to the graph nodes

◆ operator=() [1/2]

StructuralConstraintForbiddenArcs & gum::learning::StructuralConstraintForbiddenArcs::operator= ( const StructuralConstraintForbiddenArcs & from)

copy operator

Definition at line 91 of file structuralConstraintForbiddenArcs.cpp.

92 {
93 if (this != &from) { _ForbiddenArcs_forbidden_arcs_ = from._ForbiddenArcs_forbidden_arcs_; }
94 return *this;
95 }

References StructuralConstraintForbiddenArcs(), and _ForbiddenArcs_forbidden_arcs_.

Here is the call graph for this function:

◆ operator=() [2/2]

StructuralConstraintForbiddenArcs & gum::learning::StructuralConstraintForbiddenArcs::operator= ( StructuralConstraintForbiddenArcs && from)

move operator

Definition at line 99 of file structuralConstraintForbiddenArcs.cpp.

99 {
100 if (this != &from) {
101 _ForbiddenArcs_forbidden_arcs_ = std::move(from._ForbiddenArcs_forbidden_arcs_);
102 }
103 return *this;
104 }

References StructuralConstraintForbiddenArcs(), and _ForbiddenArcs_forbidden_arcs_.

Here is the call graph for this function:

◆ setArcs()

void gum::learning::StructuralConstraintForbiddenArcs::setArcs ( const ArcSet & set)

assign a set of forbidden arcs

◆ setGraphAlone()

void gum::learning::StructuralConstraintForbiddenArcs::setGraphAlone ( const DiGraph & graph)

sets a new graph from which we will perform checkings

Member Data Documentation

◆ _ForbiddenArcs_forbidden_arcs_

ArcSet gum::learning::StructuralConstraintForbiddenArcs::_ForbiddenArcs_forbidden_arcs_
protected

the ForbiddenArcs on which we perform checks

Definition at line 212 of file structuralConstraintForbiddenArcs.h.

Referenced by StructuralConstraintForbiddenArcs(), StructuralConstraintForbiddenArcs(), operator=(), and operator=().


The documentation for this class was generated from the following files: