gum::prm::gspan::FrequenceSearch< GUM_SCALAR > Class Template Reference

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...

#include <agrum/PRM/gspan/DFSTree.h>

Inheritance diagram for gum::prm::gspan::FrequenceSearch< GUM_SCALAR >:

Collaboration diagram for gum::prm::gspan::FrequenceSearch< GUM_SCALAR >:

Public Member Functions
Constructor and destructor.
	FrequenceSearch (Size freq)
	Default constructor. More...
	FrequenceSearch (const FrequenceSearch &from)
	Copy constructor. More...
virtual	~FrequenceSearch ()
	Destructor. More...
FrequenceSearch &	operator= (const FrequenceSearch &from)
	Copy operator. More...
Search methods.
virtual bool	accept_root (const Pattern *r)
virtual bool	accept_growth (const Pattern *parent, const Pattern *child, const EdgeGrowth< GUM_SCALAR > &growth)
virtual bool	operator() (LabelData *i, LabelData *j)
virtual bool	operator() (Pattern *i, Pattern *j)
Search methods.
void	setTree (DFSTree< GUM_SCALAR > *tree)

Protected Attributes
DFSTree< GUM_SCALAR > *	_tree

Protected Member Functions
double	_computeCost (const Pattern &p)

Detailed Description

template<typename GUM_SCALAR>
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.

Definition at line 123 of file searchStrategy.h.

Constructor & Destructor Documentation

FrequenceSearch() [1/2]

template<typename GUM_SCALAR >

INLINE gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::FrequenceSearch ( Size  freq )

explicit

Default constructor.

Definition at line 238 of file searchStrategy_tpl.h.

                                                                     :
          SearchStrategy< GUM_SCALAR >(), __freq(freq) {
        GUM_CONSTRUCTOR(FrequenceSearch);
      }

FrequenceSearch() [2/2]

template<typename GUM_SCALAR >

INLINE gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::FrequenceSearch

(

const FrequenceSearch< GUM_SCALAR > &

from

)

Copy constructor.

Definition at line 244 of file searchStrategy_tpl.h.

                                                    :
          SearchStrategy< GUM_SCALAR >(from),
          __freq(from.__freq) {
        GUM_CONS_CPY(FrequenceSearch);
      }

~FrequenceSearch()

template<typename GUM_SCALAR >

INLINE gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::~FrequenceSearch ( )

virtual

Destructor.

Definition at line 252 of file searchStrategy_tpl.h.

References gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::operator=().

                                                             {
        GUM_DESTRUCTOR(FrequenceSearch);
      }

Here is the call graph for this function:

Member Function Documentation

_computeCost()

template<typename GUM_SCALAR >

double gum::prm::gspan::SearchStrategy< GUM_SCALAR >::_computeCost ( const Pattern &  p )

protectedinherited

Definition at line 33 of file searchStrategy_tpl.h.

References gum::SequenceImplementation< Key, Alloc, std::is_scalar< Key >::value >::exists(), and gum::SequenceImplementation< Key, Alloc, std::is_scalar< Key >::value >::insert().

Referenced by gum::prm::gspan::StrictSearch< GUM_SCALAR >::__compute_costs(), and gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >::cost().

                                                                        {
        double                                        cost = 0;
        const Sequence< PRMInstance< GUM_SCALAR >* >& seq =
           *(this->_tree->data(p).iso_map.begin().val());
        Sequence< PRMClassElement< GUM_SCALAR >* > input_set;

        for (const auto inst : seq) {
          for (const auto input : inst->type().slotChains())
            for (const auto inst2 : inst->getInstances(input->id()))
              if ((!seq.exists(inst2))
                  && (!input_set.exists(
                        &(inst2->get(input->lastElt().safeName()))))) {
                cost += std::log(input->type().variable().domainSize());
                input_set.insert(&(inst2->get(input->lastElt().safeName())));
              }

          for (auto vec = inst->beginInvRef(); vec != inst->endInvRef(); ++vec)
            for (const auto inverse : *vec.val())
              if (!seq.exists(inverse.first)) {
                cost +=
                   std::log(inst->get(vec.key()).type().variable().domainSize());
                break;
              }
        }

        return cost;
      }

Here is the call graph for this function:

Here is the caller graph for this function:

accept_growth()

template<typename GUM_SCALAR >

INLINE bool gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::accept_growth ( const Pattern *  parent, const Pattern *  child, const EdgeGrowth< GUM_SCALAR > &  growth  )

virtual

Implements gum::prm::gspan::SearchStrategy< GUM_SCALAR >.

Definition at line 269 of file searchStrategy_tpl.h.

References gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::__freq, and gum::prm::gspan::SearchStrategy< GUM_SCALAR >::_tree.

                                                {
        return this->_tree->frequency(*child) >= __freq;
      }

accept_root()

template<typename GUM_SCALAR >

INLINE bool gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::accept_root ( const Pattern *  r )

virtual

Implements gum::prm::gspan::SearchStrategy< GUM_SCALAR >.

Definition at line 264 of file searchStrategy_tpl.h.

References gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::__freq, and gum::prm::gspan::SearchStrategy< GUM_SCALAR >::_tree.

                                                                             {
        return this->_tree->frequency(*r) >= __freq;
      }

operator()() [1/2]

template<typename GUM_SCALAR >

INLINE bool gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::operator() ( LabelData *  i, LabelData *  j  )

virtual

Implements gum::prm::gspan::SearchStrategy< GUM_SCALAR >.

Definition at line 284 of file searchStrategy_tpl.h.

References gum::prm::gspan::SearchStrategy< GUM_SCALAR >::_tree.

                                                                          {
        return (this->_tree->graph().size(i) > this->_tree->graph().size(j));
      }

operator()() [2/2]

template<typename GUM_SCALAR >

INLINE bool gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::operator() ( gspan::Pattern *  i, gspan::Pattern *  j  )

virtual

Implements gum::prm::gspan::SearchStrategy< GUM_SCALAR >.

Definition at line 277 of file searchStrategy_tpl.h.

References gum::prm::gspan::SearchStrategy< GUM_SCALAR >::_tree.

                                                                             {
        // We want a descending order
        return this->_tree->frequency(*i) > this->_tree->frequency(*j);
      }

operator=()

template<typename GUM_SCALAR >

INLINE FrequenceSearch< GUM_SCALAR > & gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::operator=

(

const FrequenceSearch< GUM_SCALAR > &

from

)

Copy operator.

Definition at line 258 of file searchStrategy_tpl.h.

References gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::__freq.

Referenced by gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::~FrequenceSearch().

                                                                                                 {
        __freq = from.__freq;
        return *this;
      }

Here is the caller graph for this function:

setTree()

template<typename GUM_SCALAR >

INLINE void gum::prm::gspan::SearchStrategy< GUM_SCALAR >::setTree ( DFSTree< GUM_SCALAR > *  tree )

inherited

Definition at line 230 of file searchStrategy_tpl.h.

References gum::prm::gspan::SearchStrategy< GUM_SCALAR >::_tree.

                                                                          {
        this->_tree = tree;
      }

Member Data Documentation

__freq

template<typename GUM_SCALAR>

Size gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::__freq

private

Definition at line 159 of file searchStrategy.h.

Referenced by gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::accept_growth(), gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::accept_root(), and gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::operator=().

_tree

template<typename GUM_SCALAR>

DFSTree< GUM_SCALAR >* gum::prm::gspan::SearchStrategy< GUM_SCALAR >::_tree

protectedinherited

Definition at line 109 of file searchStrategy.h.

Referenced by gum::prm::gspan::StrictSearch< GUM_SCALAR >::__compute_costs(), gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::accept_growth(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::accept_growth(), gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::accept_root(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::accept_root(), gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::operator()(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::operator()(), gum::prm::gspan::SearchStrategy< GUM_SCALAR >::operator=(), and gum::prm::gspan::SearchStrategy< GUM_SCALAR >::setTree().

---

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

• agrum/PRM/gspan/searchStrategy.h
• agrum/PRM/gspan/searchStrategy_tpl.h