jtree.h

Go to the documentation of this file.

/*  This file is part of libDAI - http://www.libdai.org/
 *
 *  Copyright (c) 2006-2011, The libDAI authors. All rights reserved.
 *
 *  Use of this source code is governed by a BSD-style license that can be found in the LICENSE file.
 */




#ifndef __defined_libdai_jtree_h
#define __defined_libdai_jtree_h


#include <dai/dai_config.h>
#ifdef DAI_WITH_JTREE


#include <vector>
#include <string>
#include <dai/daialg.h>
#include <dai/varset.h>
#include <dai/regiongraph.h>
#include <dai/factorgraph.h>
#include <dai/clustergraph.h>
#include <dai/weightedgraph.h>
#include <dai/enum.h>
#include <dai/properties.h>


namespace dai {



class JTree : public DAIAlgRG {
    private:
        std::vector<std::vector<Factor> >  _mes;

        Real _logZ;

    public:
        RootedTree RTree;

        std::vector<Factor> Qa;

        std::vector<Factor> Qb;

        struct Properties {

            DAI_ENUM(UpdateType,HUGIN,SHSH);


            DAI_ENUM(InfType,SUMPROD,MAXPROD);


            DAI_ENUM(HeuristicType,MINNEIGHBORS,MINWEIGHT,MINFILL,WEIGHTEDMINFILL);

            size_t verbose;

            UpdateType updates;

            InfType inference;

            HeuristicType heuristic;

            size_t maxmem;
        } props;

    public:

        JTree() : DAIAlgRG(), _mes(), _logZ(), RTree(), Qa(), Qb(), props() {}


        JTree( const FactorGraph &fg, const PropertySet &opts, bool automatic=true );



        virtual JTree* clone() const { return new JTree(*this); }
        virtual JTree* construct( const FactorGraph &fg, const PropertySet &opts ) const { return new JTree( fg, opts ); }
        virtual std::string name() const { return "JTREE"; }
        virtual Factor belief( const VarSet &vs ) const;
        virtual std::vector<Factor> beliefs() const;
        virtual Real logZ() const;
        std::vector<size_t> findMaximum() const;
        virtual void init() {}
        virtual void init( const VarSet &/*ns*/ ) {}
        virtual Real run();
        virtual Real maxDiff() const { return 0.0; }
        virtual size_t Iterations() const { return 1UL; }
        virtual void setProperties( const PropertySet &opts );
        virtual PropertySet getProperties() const;
        virtual std::string printProperties() const;




        void construct( const FactorGraph &fg, const std::vector<VarSet> &cl, bool verify=false );


        void GenerateJT( const FactorGraph &fg, const std::vector<VarSet> &cl );

        const Factor & message( size_t alpha, size_t _beta ) const { return _mes[alpha][_beta]; }
        Factor & message( size_t alpha, size_t _beta ) { return _mes[alpha][_beta]; }


        void runHUGIN();


        void runShaferShenoy();


        size_t findEfficientTree( const VarSet& vs, RootedTree &Tree, size_t PreviousRoot=(size_t)-1 ) const;


        Factor calcMarginal( const VarSet& vs );
};



std::pair<size_t,BigInt> boundTreewidth( const FactorGraph &fg, greedyVariableElimination::eliminationCostFunction fn, size_t maxStates=0 );


} // end of namespace dai


#endif


#endif