aGrUM  0.20.3
a C++ library for (probabilistic) graphical models
gum::prm::gspan::DFSTree< GUM_SCALAR >::PatternData Struct Reference

#include <DFSTree.h>

+ Collaboration diagram for gum::prm::gspan::DFSTree< GUM_SCALAR >::PatternData:

Public Attributes

Patternpattern
 The pattern. More...
 
std::list< NodeIdchildren
 The list of the pattern's children, sorted lexicographically. More...
 
UndiGraph iso_graph
 The isomorphism graph of the pattern. More...
 
NodeProperty< Sequence< PRMInstance< GUM_SCALAR > *> *> iso_map
 The instances matching p in the interface graph. More...
 
Set< NodeIdmax_indep_set
 The maximal independent set of p. More...
 
Size cost
 The cost of this Pattern. More...
 
Size gain
 The gain of this Pattern. More...
 

Public Member Functions

 PatternData (Pattern *p)
 Constructor. More...
 
 PatternData (const PatternData &from)
 Copy constructor. More...
 
 ~PatternData ()
 Destructor. More...
 

Detailed Description

template<typename GUM_SCALAR>
struct gum::prm::gspan::DFSTree< GUM_SCALAR >::PatternData

Definition at line 93 of file DFSTree.h.

Constructor & Destructor Documentation

◆ PatternData() [1/2]

template<typename GUM_SCALAR >
INLINE gum::prm::gspan::DFSTree< GUM_SCALAR >::PatternData::PatternData ( Pattern p)
explicit

Constructor.

Definition at line 537 of file DFSTree_tpl.h.

References gum::prm::gspan::operator<<().

537  :
538  pattern(p), cost(0), gain(0) {
539  GUM_CONSTRUCTOR(DFSTree< GUM_SCALAR >::PatternData);
540  }
Pattern * pattern
The pattern.
Definition: DFSTree.h:101
Size cost
The cost of this Pattern.
Definition: DFSTree.h:111
Size gain
The gain of this Pattern.
Definition: DFSTree.h:113
+ Here is the call graph for this function:

◆ PatternData() [2/2]

template<typename GUM_SCALAR >
gum::prm::gspan::DFSTree< GUM_SCALAR >::PatternData::PatternData ( const PatternData from)

Copy constructor.

Definition at line 348 of file DFSTree_tpl.h.

References gum::prm::gspan::operator<<().

348  :
349  pattern(from.pattern), children(from.children), iso_graph(from.iso_graph),
350  max_indep_set(from.max_indep_set), cost(from.cost), gain(from.gain) {
351  GUM_CONS_CPY(DFSTree< GUM_SCALAR >::PatternData);
352 
353  for (const auto& elt: from.iso_map)
354  iso_map.insert(elt.first, new Sequence< PRMInstance< GUM_SCALAR >* >(*elt.second));
355  }
Pattern * pattern
The pattern.
Definition: DFSTree.h:101
Size cost
The cost of this Pattern.
Definition: DFSTree.h:111
Set< NodeId > max_indep_set
The maximal independent set of p.
Definition: DFSTree.h:109
NodeProperty< Sequence< PRMInstance< GUM_SCALAR > *> *> iso_map
The instances matching p in the interface graph.
Definition: DFSTree.h:107
Size gain
The gain of this Pattern.
Definition: DFSTree.h:113
UndiGraph iso_graph
The isomorphism graph of the pattern.
Definition: DFSTree.h:105
std::list< NodeId > children
The list of the pattern&#39;s children, sorted lexicographically.
Definition: DFSTree.h:103
+ Here is the call graph for this function:

◆ ~PatternData()

template<typename GUM_SCALAR >
gum::prm::gspan::DFSTree< GUM_SCALAR >::PatternData::~PatternData ( )

Destructor.

Definition at line 358 of file DFSTree_tpl.h.

References gum::prm::gspan::operator<<().

358  {
359  GUM_DESTRUCTOR(DFSTree< GUM_SCALAR >::PatternData);
360 
361  for (const auto& elt: iso_map)
362  delete elt.second;
363  }
NodeProperty< Sequence< PRMInstance< GUM_SCALAR > *> *> iso_map
The instances matching p in the interface graph.
Definition: DFSTree.h:107
+ Here is the call graph for this function:

Member Data Documentation

◆ children

template<typename GUM_SCALAR >
std::list< NodeId > gum::prm::gspan::DFSTree< GUM_SCALAR >::PatternData::children

The list of the pattern's children, sorted lexicographically.

Definition at line 103 of file DFSTree.h.

◆ cost

template<typename GUM_SCALAR >
Size gum::prm::gspan::DFSTree< GUM_SCALAR >::PatternData::cost

The cost of this Pattern.

Definition at line 111 of file DFSTree.h.

◆ gain

template<typename GUM_SCALAR >
Size gum::prm::gspan::DFSTree< GUM_SCALAR >::PatternData::gain

The gain of this Pattern.

Definition at line 113 of file DFSTree.h.

◆ iso_graph

template<typename GUM_SCALAR >
UndiGraph gum::prm::gspan::DFSTree< GUM_SCALAR >::PatternData::iso_graph

The isomorphism graph of the pattern.

Definition at line 105 of file DFSTree.h.

◆ iso_map

template<typename GUM_SCALAR >
NodeProperty< Sequence< PRMInstance< GUM_SCALAR >* >* > gum::prm::gspan::DFSTree< GUM_SCALAR >::PatternData::iso_map

The instances matching p in the interface graph.

Definition at line 107 of file DFSTree.h.

◆ max_indep_set

template<typename GUM_SCALAR >
Set< NodeId > gum::prm::gspan::DFSTree< GUM_SCALAR >::PatternData::max_indep_set

The maximal independent set of p.

Definition at line 109 of file DFSTree.h.

◆ pattern

template<typename GUM_SCALAR >
Pattern* gum::prm::gspan::DFSTree< GUM_SCALAR >::PatternData::pattern

The pattern.

Definition at line 101 of file DFSTree.h.


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