gum::prm::gspan::StrictSearch< GUM_SCALAR >::PData Struct Reference

Private structure to represent data about a pattern. More...

Collaboration diagram for gum::prm::gspan::StrictSearch< GUM_SCALAR >::PData:

Public Attributes
UndiGraph	graph
	A yet to be triangulated undigraph. More...
NodeProperty< Size >	mod
	The pattern's variables modalities. More...
Bijection< NodeId, std::string >	node2attr
	A bijection to easily keep track between graph and attributes, its of the form instance_name DOT attr_name. More...
Bijection< NodeId, const DiscreteVariable *>	vars
	Bijection between graph's nodes and their corresponding DiscreteVariable, for inference purpose. More...
NodeSet	inners
	Returns the set of inner nodes. More...
NodeSet	outputs
	Returns the set of outputs nodes given all the matches of pattern. More...

Detailed Description

template<typename GUM_SCALAR>
struct gum::prm::gspan::StrictSearch< GUM_SCALAR >::PData

Private structure to represent data about a pattern.

Definition at line 218 of file searchStrategy.h.

Member Data Documentation

graph

template<typename GUM_SCALAR>

UndiGraph gum::prm::gspan::StrictSearch< GUM_SCALAR >::PData::graph

A yet to be triangulated undigraph.

Definition at line 220 of file searchStrategy.h.

Referenced by gum::prm::gspan::StrictSearch< GUM_SCALAR >::__buildPatternGraph(), and gum::prm::gspan::StrictSearch< GUM_SCALAR >::__elimination_cost().

inners

template<typename GUM_SCALAR>

NodeSet gum::prm::gspan::StrictSearch< GUM_SCALAR >::PData::inners

Returns the set of inner nodes.

Definition at line 233 of file searchStrategy.h.

Referenced by gum::prm::gspan::StrictSearch< GUM_SCALAR >::__buildPatternGraph(), and gum::prm::gspan::StrictSearch< GUM_SCALAR >::__elimination_cost().

mod

template<typename GUM_SCALAR>

NodeProperty< Size > gum::prm::gspan::StrictSearch< GUM_SCALAR >::PData::mod

The pattern's variables modalities.

Definition at line 222 of file searchStrategy.h.

Referenced by gum::prm::gspan::StrictSearch< GUM_SCALAR >::__buildPatternGraph(), and gum::prm::gspan::StrictSearch< GUM_SCALAR >::__elimination_cost().

node2attr

template<typename GUM_SCALAR>

Bijection< NodeId, std::string > gum::prm::gspan::StrictSearch< GUM_SCALAR >::PData::node2attr

A bijection to easily keep track between graph and attributes, its of the form instance_name DOT attr_name.

Definition at line 227 of file searchStrategy.h.

Referenced by gum::prm::gspan::StrictSearch< GUM_SCALAR >::__buildPatternGraph().

outputs

template<typename GUM_SCALAR>

NodeSet gum::prm::gspan::StrictSearch< GUM_SCALAR >::PData::outputs

Returns the set of outputs nodes given all the matches of pattern.

Definition at line 235 of file searchStrategy.h.

Referenced by gum::prm::gspan::StrictSearch< GUM_SCALAR >::__buildPatternGraph(), and gum::prm::gspan::StrictSearch< GUM_SCALAR >::__elimination_cost().

vars

template<typename GUM_SCALAR>

Bijection< NodeId, const DiscreteVariable* > gum::prm::gspan::StrictSearch< GUM_SCALAR >::PData::vars

Bijection between graph's nodes and their corresponding DiscreteVariable, for inference purpose.

Definition at line 231 of file searchStrategy.h.

Referenced by gum::prm::gspan::StrictSearch< GUM_SCALAR >::__buildPatternGraph(), and gum::prm::gspan::StrictSearch< GUM_SCALAR >::__elimination_cost().

---

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

• agrum/PRM/gspan/searchStrategy.h