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

This is an abstract class used to tune search strategies in the gspan algorithm. More...

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

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

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

Protected Attributes
DFSTree< GUM_SCALAR > *	_tree

Protected Member Functions
double	_computeCost (const Pattern &p)

Detailed Description

template<typename GUM_SCALAR>
class gum::prm::gspan::SearchStrategy< GUM_SCALAR >

This is an abstract class used to tune search strategies in the gspan algorithm.

Since GSpan uses a DFS to expand the search tree, this class works as a stack regarding adding and removing informations about the growths.

Definition at line 61 of file DFSTree.h.

Constructor & Destructor Documentation

SearchStrategy() [1/2]

template<typename GUM_SCALAR >

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

(

)

Default constructor.

Definition at line 208 of file searchStrategy_tpl.h.

                                                          : _tree(0) {
        GUM_CONSTRUCTOR(SearchStrategy);
      }

SearchStrategy() [2/2]

template<typename GUM_SCALAR >

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

(

const SearchStrategy< GUM_SCALAR > &

from

)

Copy constructor.

Definition at line 213 of file searchStrategy_tpl.h.

                                                   :
          _tree(from._tree) {
        GUM_CONS_CPY(SearchStrategy);
      }

~SearchStrategy()

template<typename GUM_SCALAR >

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

virtual

Destructor.

Definition at line 220 of file searchStrategy_tpl.h.

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

                                                           {
        GUM_DESTRUCTOR(SearchStrategy);
      }

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 )

protected

Definition at line 36 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>

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

pure virtual

Implemented in gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >, gum::prm::gspan::StrictSearch< GUM_SCALAR >, and gum::prm::gspan::FrequenceSearch< GUM_SCALAR >.

accept_root()

template<typename GUM_SCALAR>

virtual bool gum::prm::gspan::SearchStrategy< GUM_SCALAR >::accept_root ( const Pattern *  r )

pure virtual

Implemented in gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >, gum::prm::gspan::StrictSearch< GUM_SCALAR >, and gum::prm::gspan::FrequenceSearch< GUM_SCALAR >.

operator()() [1/2]

template<typename GUM_SCALAR>

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

pure virtual

Implemented in gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >, gum::prm::gspan::StrictSearch< GUM_SCALAR >, and gum::prm::gspan::FrequenceSearch< GUM_SCALAR >.

operator()() [2/2]

template<typename GUM_SCALAR>

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

pure virtual

Implemented in gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >, gum::prm::gspan::StrictSearch< GUM_SCALAR >, and gum::prm::gspan::FrequenceSearch< GUM_SCALAR >.

operator=()

template<typename GUM_SCALAR >

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

(

const SearchStrategy< GUM_SCALAR > &

from

)

Copy operator.

Definition at line 226 of file searchStrategy_tpl.h.

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

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

                                                                                               {
        this->_tree = from._tree;
        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

)

Definition at line 233 of file searchStrategy_tpl.h.

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

                                                                          {
        this->_tree = tree;
      }

Member Data Documentation

_tree

template<typename GUM_SCALAR>

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

protected

Definition at line 112 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/DFSTree.h
• agrum/PRM/gspan/searchStrategy.h
• agrum/PRM/gspan/searchStrategy_tpl.h