aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
gum::prm::StructuredInference< GUM_SCALAR >::RGData Struct Reference

Private structure to represent data about a reduced graph. More...

Collaboration diagram for gum::prm::StructuredInference< GUM_SCALAR >::RGData:

Public Member Functions

 RGData ()
 Default constructor.
 ~RGData ()
 Destructor.
NodeSetoutputs ()
 Returns the set of outputs nodes (which will be eliminated).
NodeSetqueries ()
 Returns the set of query nodes (which will not be eliminated).

Public Attributes

UndiGraph reducedGraph
 The reduced graph.
NodeProperty< Sizemods
 Mapping between NodeId and modalities.
Bijection< const DiscreteVariable *, NodeIdvar2node
 Mapping between DiscreteVariable and NodeId.
Set< Tensor< GUM_SCALAR > * > pool
 The pool of tensors matching the reduced graph.
List< NodeSetpartial_order
 Partial order used for triangulation, first is outputs nodes, second query nodes.

Detailed Description

template<typename GUM_SCALAR>
struct gum::prm::StructuredInference< GUM_SCALAR >::RGData

Private structure to represent data about a reduced graph.

Definition at line 136 of file structuredInference.h.

Constructor & Destructor Documentation

◆ RGData()

template<typename GUM_SCALAR>
gum::prm::StructuredInference< GUM_SCALAR >::RGData::RGData ( )

Default constructor.

Definition at line 782 of file structuredInference_tpl.h.

782 {
784 partial_order.insert(NodeSet());
785 partial_order.insert(NodeSet());
786 }
<agrum/PRM/structuredInference.h>
Set< NodeId > NodeSet
Some typdefs and define for shortcuts ...
List< NodeSet > partial_order
Partial order used for triangulation, first is outputs nodes, second query nodes.

References partial_order.

◆ ~RGData()

template<typename GUM_SCALAR>
INLINE gum::prm::StructuredInference< GUM_SCALAR >::RGData::~RGData ( )

Destructor.

Definition at line 962 of file structuredInference_tpl.h.

Member Function Documentation

◆ outputs()

template<typename GUM_SCALAR>
NodeSet & gum::prm::StructuredInference< GUM_SCALAR >::RGData::outputs ( )
inline

Returns the set of outputs nodes (which will be eliminated).

Definition at line 154 of file structuredInference.h.

154{ return partial_order[0]; }

References partial_order.

Referenced by gum::prm::StructuredInference< GUM_SCALAR >::_addEdgesInReducedGraph_(), and gum::prm::StructuredInference< GUM_SCALAR >::_buildReduceGraph_().

Here is the caller graph for this function:

◆ queries()

template<typename GUM_SCALAR>
NodeSet & gum::prm::StructuredInference< GUM_SCALAR >::RGData::queries ( )
inline

Returns the set of query nodes (which will not be eliminated).

Definition at line 157 of file structuredInference.h.

157{ return partial_order[1]; }

References partial_order.

Referenced by gum::prm::StructuredInference< GUM_SCALAR >::_buildReduceGraph_().

Here is the caller graph for this function:

Member Data Documentation

◆ mods

template<typename GUM_SCALAR>
NodeProperty< Size > gum::prm::StructuredInference< GUM_SCALAR >::RGData::mods

◆ partial_order

template<typename GUM_SCALAR>
List< NodeSet > gum::prm::StructuredInference< GUM_SCALAR >::RGData::partial_order

Partial order used for triangulation, first is outputs nodes, second query nodes.

Definition at line 147 of file structuredInference.h.

Referenced by RGData(), gum::prm::StructuredInference< GUM_SCALAR >::_buildReduceGraph_(), outputs(), and queries().

◆ pool

◆ reducedGraph

template<typename GUM_SCALAR>
UndiGraph gum::prm::StructuredInference< GUM_SCALAR >::RGData::reducedGraph

◆ var2node


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