gum::learning::StructuralConstraintDiGraph Class Reference

The base class for structural constraints used by learning algorithms that learn a directed graph structure. More...

#include <structuralConstraintDiGraph.h>

Inheritance diagram for gum::learning::StructuralConstraintDiGraph:

Collaboration diagram for gum::learning::StructuralConstraintDiGraph:

Public Types
using	allConstraints = _ConstraintSet_< void >

Public Member Functions
Constructors / Destructors
	StructuralConstraintDiGraph ()
	default constructor
	StructuralConstraintDiGraph (Size nb_nodes)
	constructor starting with an empty graph with a given number of nodes
	StructuralConstraintDiGraph (const DiGraph &graph)
	constructor starting with a given graph
	StructuralConstraintDiGraph (const StructuralConstraintDiGraph &from)
	copy constructor
	StructuralConstraintDiGraph (StructuralConstraintDiGraph &&from) noexcept
	move constructor
virtual	~StructuralConstraintDiGraph ()
	destructor
Operators
StructuralConstraintDiGraph &	operator= (const StructuralConstraintDiGraph &from)
	copy operator
StructuralConstraintDiGraph &	operator= (StructuralConstraintDiGraph &&from)
	move operator
Specific Accessors / Modifiers
void	setGraph (Size nb_nodes)
	sets a new empty graph from which we will perform checking
void	setGraphAlone (const DiGraph &graph)
	sets a new graph from which we will perform checking
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 ArcTriangleDeletion1 &change)
	notify the constraint of a modification of the graph
void	modifyGraphAlone (const ArcTriangleDeletion2 &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	checkArcTriangleDeletion1Alone (NodeId node1, NodeId node2, NodeId node3) const
	checks whether the constraints enable to apply an ArcTriangleDeletion1
bool	checkArcTriangleDeletion2Alone (NodeId node1, NodeId node2, NodeId node3) const
	checks whether the constraints enable to apply an ArcTriangleDeletion2
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
bool	checkModificationAlone (const ArcTriangleDeletion1 &change) const
	checks whether the constraints enable to apply an ArcTriangleDeletion1
bool	checkModificationAlone (const ArcTriangleDeletion2 &change) const
	checks whether the constraints enable to apply an ArcTriangleDeletion2

Protected Attributes
DiGraph	_graph_
	the DiGraph on which we perform checks

Detailed Description

The base class for structural constraints used by learning algorithms that learn a directed graph structure.

This base should always be a virtual parents of the structural constraints classes. This will allow to combine different constraints into a single class

Definition at line 68 of file structuralConstraintDiGraph.h.

Member Typedef Documentation

allConstraints

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

inherited

Definition at line 61 of file structuralConstraint.h.

Constructor & Destructor Documentation

StructuralConstraintDiGraph() [1/5]

gum::learning::StructuralConstraintDiGraph::StructuralConstraintDiGraph

(

)

default constructor

Definition at line 61 of file structuralConstraintDiGraph.cpp.

                                                             {
      GUM_CONSTRUCTOR(StructuralConstraintDiGraph);
    }

References StructuralConstraintDiGraph().

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

Here is the call graph for this function:

Here is the caller graph for this function:

StructuralConstraintDiGraph() [2/5]

gum::learning::StructuralConstraintDiGraph::StructuralConstraintDiGraph

(

Size

nb_nodes

)

constructor starting with an empty graph with a given number of nodes

Definition at line 66 of file structuralConstraintDiGraph.cpp.

                                                                          {
      setGraph(nb_nodes);
      GUM_CONSTRUCTOR(StructuralConstraintDiGraph);
    }

References StructuralConstraintDiGraph(), and setGraph().

Here is the call graph for this function:

StructuralConstraintDiGraph() [3/5]

gum::learning::StructuralConstraintDiGraph::StructuralConstraintDiGraph

(

const DiGraph &

graph

)

constructor starting with a given graph

Definition at line 72 of file structuralConstraintDiGraph.cpp.

                                                                                 {
      setGraph(graph);
      GUM_CONSTRUCTOR(StructuralConstraintDiGraph);
    }

References StructuralConstraintDiGraph(), and setGraph().

Here is the call graph for this function:

StructuralConstraintDiGraph() [4/5]

gum::learning::StructuralConstraintDiGraph::StructuralConstraintDiGraph

(

const StructuralConstraintDiGraph &

from

)

copy constructor

Definition at line 78 of file structuralConstraintDiGraph.cpp.

                                                 : _graph_(from._graph_) {
      GUM_CONS_CPY(StructuralConstraintDiGraph);
    }

References StructuralConstraintDiGraph(), and _graph_.

Here is the call graph for this function:

StructuralConstraintDiGraph() [5/5]

gum::learning::StructuralConstraintDiGraph::StructuralConstraintDiGraph ( StructuralConstraintDiGraph && from )

noexcept

move constructor

Definition at line 84 of file structuralConstraintDiGraph.cpp.

                                                     : _graph_(std::move(from._graph_)) {
      GUM_CONS_MOV(StructuralConstraintDiGraph);
    }

References StructuralConstraintDiGraph(), and _graph_.

Here is the call graph for this function:

~StructuralConstraintDiGraph()

gum::learning::StructuralConstraintDiGraph::~StructuralConstraintDiGraph ( )

virtual

destructor

Definition at line 90 of file structuralConstraintDiGraph.cpp.

                                                              {
      GUM_DESTRUCTOR(StructuralConstraintDiGraph);
    }

References StructuralConstraintDiGraph().

Here is the call graph for this function:

Member Function Documentation

checkArcAdditionAlone()

bool gum::learning::StructuralConstraintDiGraph::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.

Referenced by checkModificationAlone().

Here is the caller graph for this function:

checkArcDeletionAlone()

bool gum::learning::StructuralConstraintDiGraph::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.

Referenced by checkModificationAlone().

Here is the caller graph for this function:

checkArcReversalAlone()

bool gum::learning::StructuralConstraintDiGraph::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.

Referenced by checkModificationAlone().

Here is the caller graph for this function:

checkArcTriangleDeletion1Alone()

bool gum::learning::StructuralConstraintDiGraph::checkArcTriangleDeletion1Alone	(	NodeId	node1,
		NodeId	node2,
		NodeId	node3 ) const

checks whether the constraints enable to apply an ArcTriangleDeletion1

An arc triangle deletion1 substitutes triangle node1 -> node2 -> node3 + node1 -> node3 into v-structure node2 -> node1 <- node3

Referenced by checkModificationAlone().

Here is the caller graph for this function:

checkArcTriangleDeletion2Alone()

bool gum::learning::StructuralConstraintDiGraph::checkArcTriangleDeletion2Alone	(	NodeId	node1,
		NodeId	node2,
		NodeId	node3 ) const

checks whether the constraints enable to apply an ArcTriangleDeletion2

An arc triangle deletion1 substitutes triangle node1 -> node2 -> node3 + node1 -> node3 into v-structure node1 -> node2 <- node3

Referenced by checkModificationAlone().

Here is the caller graph for this function:

checkModificationAlone() [1/6]

bool gum::learning::StructuralConstraintDiGraph::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/6]

bool gum::learning::StructuralConstraintDiGraph::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/6]

bool gum::learning::StructuralConstraintDiGraph::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/6]

bool gum::learning::StructuralConstraintDiGraph::checkModificationAlone

(

const ArcTriangleDeletion1 &

change

)

const

checks whether the constraints enable to apply an ArcTriangleDeletion1

An arc triangle deletion1 substitutes triangle node1 -> node2 -> node3 + node1 -> node3 into v-structure node2 -> node1 <- node3

checkModificationAlone() [5/6]

bool gum::learning::StructuralConstraintDiGraph::checkModificationAlone

(

const ArcTriangleDeletion2 &

change

)

const

checks whether the constraints enable to apply an ArcTriangleDeletion2

An arc triangle deletion1 substitutes triangle node1 -> node2 -> node3 + node1 -> node3 into v-structure node1 -> node2 <- node3

checkModificationAlone() [6/6]

bool gum::learning::StructuralConstraintDiGraph::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.

Definition at line 108 of file structuralConstraintDiGraph.cpp.

                                                                                            {
      switch (change.type()) {
        case GraphChangeType::ARC_ADDITION :
          return checkArcAdditionAlone(change.node1(), change.node2());
 
        case GraphChangeType::ARC_DELETION :
          return checkArcDeletionAlone(change.node1(), change.node2());
 
        case GraphChangeType::ARC_REVERSAL :
          return checkArcReversalAlone(change.node1(), change.node2());
 
        case GraphChangeType::ARC_TRIANGLE_DELETION1 :
          return checkArcTriangleDeletion1Alone(change.node1(), change.node2(), change.node3());
 
        case GraphChangeType::ARC_TRIANGLE_DELETION2 :
          return checkArcTriangleDeletion2Alone(change.node1(), change.node2(), change.node3());
 
        default :
          GUM_ERROR(OperationNotAllowed,
                    "Graph change operation "
                        << change.typeAsString()
                        << " is not supported by the DiGraph structural constraint");
      }
    }

References gum::learning::ARC_ADDITION, gum::learning::ARC_DELETION, gum::learning::ARC_REVERSAL, gum::learning::ARC_TRIANGLE_DELETION1, gum::learning::ARC_TRIANGLE_DELETION2, checkArcAdditionAlone(), checkArcDeletionAlone(), checkArcReversalAlone(), checkArcTriangleDeletion1Alone(), checkArcTriangleDeletion2Alone(), GUM_ERROR, gum::learning::GraphChange::node1(), gum::learning::GraphChange::node2(), gum::learning::GraphChange::node3(), gum::learning::GraphChange::type(), and gum::learning::GraphChange::typeAsString().

Here is the call graph for this function:

isAlwaysInvalidAlone()

bool gum::learning::StructuralConstraintDiGraph::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/6]

void gum::learning::StructuralConstraintDiGraph::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

InvalidNode

exception is thrown if an arc (x,y) is added and x or y does not belong to the graph nodes

Referenced by modifyGraphAlone().

Here is the caller graph for this function:

modifyGraphAlone() [2/6]

void gum::learning::StructuralConstraintDiGraph::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/6]

void gum::learning::StructuralConstraintDiGraph::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

InvalidNode

exception is thrown if at least one extremity of the arc does not belong to the graph nodes

modifyGraphAlone() [4/6]

void gum::learning::StructuralConstraintDiGraph::modifyGraphAlone

(

const ArcTriangleDeletion1 &

change

)

notify the constraint of a modification of the graph

An arc triangle deletion1 substitutes triangle node1 -> node2 -> node3 + node1 -> node3 into v-structure node2 -> node1 <- node3

modifyGraphAlone() [5/6]

void gum::learning::StructuralConstraintDiGraph::modifyGraphAlone

(

const ArcTriangleDeletion2 &

change

)

notify the constraint of a modification of the graph

An arc triangle deletion1 substitutes triangle node1 -> node2 -> node3 + node1 -> node3 into v-structure node1 -> node2 <- node3

modifyGraphAlone() [6/6]

void gum::learning::StructuralConstraintDiGraph::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

InvalidNode

exception is thrown if an arc (x,y) is added and x or y does not belong to the graph nodes

Definition at line 133 of file structuralConstraintDiGraph.cpp.

                                                                                {
      switch (change.type()) {
        case GraphChangeType::ARC_ADDITION :
          modifyGraphAlone(reinterpret_cast< const ArcAddition& >(change));
          break;
 
        case GraphChangeType::ARC_DELETION :
          modifyGraphAlone(reinterpret_cast< const ArcDeletion& >(change));
          break;
 
        case GraphChangeType::ARC_REVERSAL :
          modifyGraphAlone(reinterpret_cast< const ArcReversal& >(change));
          break;
 
        case GraphChangeType::ARC_TRIANGLE_DELETION1 :
          modifyGraphAlone(reinterpret_cast< const ArcTriangleDeletion1& >(change));
          break;
 
        case GraphChangeType::ARC_TRIANGLE_DELETION2 :
          modifyGraphAlone(reinterpret_cast< const ArcTriangleDeletion2& >(change));
          break;
 
        default :
          GUM_ERROR(OperationNotAllowed,
                    "Graph change operation "
                        << change.typeAsString()
                        << " is not supported by the DiGraph structural constraint")
      }
    }

References gum::learning::ARC_ADDITION, gum::learning::ARC_DELETION, gum::learning::ARC_REVERSAL, gum::learning::ARC_TRIANGLE_DELETION1, gum::learning::ARC_TRIANGLE_DELETION2, GUM_ERROR, modifyGraphAlone(), gum::learning::GraphChange::type(), and gum::learning::GraphChange::typeAsString().

Here is the call graph for this function:

operator=() [1/2]

StructuralConstraintDiGraph & gum::learning::StructuralConstraintDiGraph::operator=

(

const StructuralConstraintDiGraph &

from

)

copy operator

Definition at line 96 of file structuralConstraintDiGraph.cpp.

                                                                                    {
      if (this != &from) { _graph_ = from._graph_; }
      return *this;
    }

References StructuralConstraintDiGraph(), and _graph_.

Referenced by gum::learning::StructuralConstraintIndegree::operator=(), gum::learning::StructuralConstraintIndegree::operator=(), gum::learning::StructuralConstraintSliceOrder::operator=(), and gum::learning::StructuralConstraintSliceOrder::operator=().

Here is the call graph for this function:

Here is the caller graph for this function:

operator=() [2/2]

StructuralConstraintDiGraph & gum::learning::StructuralConstraintDiGraph::operator=

(

StructuralConstraintDiGraph &&

from

)

move operator

Definition at line 103 of file structuralConstraintDiGraph.cpp.

                                                                               {
      if (this != &from) { _graph_ = std::move(from._graph_); }
      return *this;
    }

References StructuralConstraintDiGraph(), and _graph_.

Here is the call graph for this function:

setGraph()

void gum::learning::StructuralConstraintDiGraph::setGraph

(

Size

nb_nodes

)

sets a new empty graph from which we will perform checking

Referenced by StructuralConstraintDiGraph(), and StructuralConstraintDiGraph().

Here is the caller graph for this function:

setGraphAlone()

void gum::learning::StructuralConstraintDiGraph::setGraphAlone

(

const DiGraph &

graph

)

sets a new graph from which we will perform checking

Member Data Documentation

_graph_

DiGraph gum::learning::StructuralConstraintDiGraph::_graph_

protected

the DiGraph on which we perform checks

Definition at line 246 of file structuralConstraintDiGraph.h.

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

---

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

• agrum/BN/learning/constraints/structuralConstraintDiGraph.h
• agrum/BN/learning/constraints/structuralConstraintDiGraph.cpp