![]() |
aGrUM
0.20.3
a C++ library for (probabilistic) graphical models
|
Private structure to represent data about a pattern. More...
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... | |
Private structure to represent data about a pattern.
Definition at line 217 of file searchStrategy.h.
UndiGraph gum::prm::gspan::StrictSearch< GUM_SCALAR >::PData::graph |
A yet to be triangulated undigraph.
Definition at line 219 of file searchStrategy.h.
NodeSet gum::prm::gspan::StrictSearch< GUM_SCALAR >::PData::inners |
Returns the set of inner nodes.
Definition at line 232 of file searchStrategy.h.
NodeProperty< Size > gum::prm::gspan::StrictSearch< GUM_SCALAR >::PData::mod |
The pattern's variables modalities.
Definition at line 221 of file searchStrategy.h.
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 226 of file searchStrategy.h.
NodeSet gum::prm::gspan::StrictSearch< GUM_SCALAR >::PData::outputs |
Returns the set of outputs nodes given all the matches of pattern.
Definition at line 234 of file searchStrategy.h.
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 230 of file searchStrategy.h.