A growth is accepted if and only if the new growth has a tree width less large or equal than its father. More...

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

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

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

Public Member Functions
Constructor and destructor.
	TreeWidthSearch ()
	Default constructor.
	TreeWidthSearch (const TreeWidthSearch &from)
	Copy constructor.
virtual	~TreeWidthSearch ()
	Destructor.
TreeWidthSearch &	operator= (const TreeWidthSearch &from)
	Copy operator.
Search methods.
double	cost (const Pattern &p)
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 Member Functions
double	computeCost_ (const Pattern &p)

Protected Attributes
DFSTree< GUM_SCALAR > *	tree_

Private Attributes
HashTable< const Pattern *, double >	_map_

Detailed Description

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

Definition at line 271 of file searchStrategy.h.

Constructor & Destructor Documentation

◆ TreeWidthSearch() [1/2]

template<typename GUM_SCALAR>

INLINE gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >::TreeWidthSearch ( )

Default constructor.

Definition at line 401 of file searchStrategy_tpl.h.

                                                            : SearchStrategy< GUM_SCALAR >() {
        GUM_CONSTRUCTOR(TreeWidthSearch);
      }

References gum::prm::gspan::SearchStrategy< GUM_SCALAR >::SearchStrategy(), and TreeWidthSearch().

Referenced by TreeWidthSearch(), TreeWidthSearch(), ~TreeWidthSearch(), and operator=().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ TreeWidthSearch() [2/2]

template<typename GUM_SCALAR>

INLINE gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >::TreeWidthSearch ( const TreeWidthSearch< GUM_SCALAR > & from )

Copy constructor.

Definition at line 406 of file searchStrategy_tpl.h.

                                                     : SearchStrategy< GUM_SCALAR >(from) {
        GUM_CONS_CPY(TreeWidthSearch);
      }

References gum::prm::gspan::SearchStrategy< GUM_SCALAR >::SearchStrategy(), and TreeWidthSearch().

Here is the call graph for this function:

◆ ~TreeWidthSearch()

template<typename GUM_SCALAR>

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

virtual

Destructor.

Definition at line 412 of file searchStrategy_tpl.h.

                                                             {
        GUM_DESTRUCTOR(TreeWidthSearch);
      }

References TreeWidthSearch().

Here is the call graph for this function:

Member Function Documentation

◆ accept_growth()

template<typename GUM_SCALAR>

INLINE bool gum::prm::gspan::TreeWidthSearch< 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 444 of file searchStrategy_tpl.h.

                                                                                               {
        return cost(*parent) >= cost(*child);
      }

References cost().

Here is the call graph for this function:

◆ accept_root()

template<typename GUM_SCALAR>

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

virtual

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

Definition at line 433 of file searchStrategy_tpl.h.

                                                                             {
        Size tree_width = 0;
 
        for (const auto n: r->nodes())
          tree_width += r->label(n).tree_width;
 
        return tree_width >= cost(*r);
      }

References cost(), gum::prm::gspan::Pattern::label(), gum::prm::gspan::Pattern::nodes(), and gum::prm::gspan::LabelData::tree_width.

Here is the call graph for this function:

◆ computeCost_()

template<typename GUM_SCALAR>

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

protectedinherited

Definition at line 56 of file searchStrategy_tpl.h.

                                                                        {
        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;
      }

References gum::SequenceImplementation< Key, Gen >::exists(), gum::SequenceImplementation< Key, Gen >::insert(), and tree_.

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

Here is the call graph for this function:

Here is the caller graph for this function:

◆ cost()

template<typename GUM_SCALAR>

INLINE double gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >::cost ( const Pattern & p )

Definition at line 423 of file searchStrategy_tpl.h.

                                                                        {
        try {
          return _map_[&p];
        } catch (NotFound const&) {
          _map_.insert(&p, this->computeCost_(p));
          return _map_[&p];
        }
      }

References _map_, and gum::prm::gspan::SearchStrategy< GUM_SCALAR >::computeCost_().

Referenced by accept_growth(), accept_root(), and operator()().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ operator()() [1/2]

template<typename GUM_SCALAR>

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

virtual

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

Definition at line 456 of file searchStrategy_tpl.h.

                                                                                      {
        return i->tree_width < j->tree_width;
      }

References gum::prm::gspan::LabelData::tree_width.

◆ operator()() [2/2]

template<typename GUM_SCALAR>

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

virtual

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

Definition at line 451 of file searchStrategy_tpl.h.

                                                                                            {
        return cost(*i) < cost(*j);
      }

References cost().

Here is the call graph for this function:

◆ operator=()

template<typename GUM_SCALAR>

INLINE TreeWidthSearch< GUM_SCALAR > & gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >::operator= ( const TreeWidthSearch< GUM_SCALAR > & from )

Copy operator.

Definition at line 418 of file searchStrategy_tpl.h.

                                                                                             {
        return *this;
      }

References TreeWidthSearch().

Here is the call 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 238 of file searchStrategy_tpl.h.

                                                                                   {
        this->tree_ = tree;
      }

References tree_.

Member Data Documentation

◆ _map_

template<typename GUM_SCALAR>

HashTable< const Pattern*, double > gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >::_map_

private

Definition at line 309 of file searchStrategy.h.

Referenced by cost().

◆ tree_

template<typename GUM_SCALAR>

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

protectedinherited

Definition at line 120 of file searchStrategy.h.

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

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

Public Member Functions

Protected Member Functions

Protected Attributes

Private Attributes

Detailed Description

Constructor & Destructor Documentation

◆ TreeWidthSearch() [1/2]

◆ TreeWidthSearch() [2/2]

◆ ~TreeWidthSearch()

Member Function Documentation

◆ accept_growth()

◆ accept_root()

◆ computeCost_()

◆ cost()

◆ operator()() [1/2]

◆ operator()() [2/2]

◆ operator=()

◆ setTree()

Member Data Documentation

◆ _map_

◆ tree_