![]() |
aGrUM
0.14.2
|
Headers of the SearchStrategy class and child. More...
#include <list>
#include <ostream>
#include <utility>
#include <vector>
#include <agrum/core/math/math.h>
#include <agrum/core/bijection.h>
#include <agrum/core/sequence.h>
#include <agrum/core/set.h>
#include <agrum/graphs/diGraph.h>
#include <agrum/graphs/algorithms/triangulations/partialOrderedTriangulation.h>
#include <agrum/PRM/gspan/edgeGrowth.h>
#include <agrum/PRM/gspan/interfaceGraph.h>
#include <agrum/PRM/gspan/pattern.h>
#include <agrum/PRM/gspan/searchStrategy_tpl.h>
Go to the source code of this file.
Classes | |
class | gum::prm::GSpan< GUM_SCALAR > |
This class discovers pattern in a PRM<GUM_SCALAR>'s PRMSystem<GUM_SCALAR> to speed up structured inference. More... | |
class | gum::prm::gspan::DFSTree< GUM_SCALAR > |
A DFSTree is used by gspan to sort lexicographically patterns discovered in an interface graph. More... | |
class | gum::prm::gspan::SearchStrategy< GUM_SCALAR > |
This is an abstract class used to tune search strategies in the gspan algorithm. More... | |
class | gum::prm::gspan::FrequenceSearch< GUM_SCALAR > |
This is class is an implementation of a simple serach strategy for the gspan algorithm: it accept a growth if its frequency is above a user defined value. More... | |
class | gum::prm::gspan::StrictSearch< GUM_SCALAR > |
This is class is an implementation of a strict strategy for the GSpan algorithm. More... | |
struct | gum::prm::gspan::StrictSearch< GUM_SCALAR >::PData |
Private structure to represent data about a pattern. More... | |
class | gum::prm::gspan::TreeWidthSearch< GUM_SCALAR > |
A growth is accepted if and only if the new growth has a tree width less large or equal than its father. More... | |
Namespaces | |
gum | |
gum is the global namespace for all aGrUM entities | |
gum::prm | |
namespace for all probabilistic relational models entities | |
gum::prm::gspan | |
Headers of the SearchStrategy class and child.
Definition in file searchStrategy.h.