48b8b47af305f0c4c231b5e3f47c9519e7996314
1 /* Copyright (C) 2006-2008 Joris Mooij [j dot mooij at science dot ru dot nl]
2 Radboud University Nijmegen, The Netherlands
4 This file is part of libDAI.
6 libDAI is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
11 libDAI is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with libDAI; if not, write to the Free Software
18 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
22 #ifndef __defined_libdai_jtree_h
23 #define __defined_libdai_jtree_h
28 #include <dai/daialg.h>
29 #include <dai/varset.h>
30 #include <dai/regiongraph.h>
31 #include <dai/factorgraph.h>
32 #include <dai/clustergraph.h>
33 #include <dai/weightedgraph.h>
40 class JTree
: public DAIAlgRG
{
42 DEdgeVec _RTree
; // rooted tree
43 std::vector
<Factor
> _Qa
;
44 std::vector
<Factor
> _Qb
;
45 std::vector
<Factor
> _mes
;
50 ENUM2(UpdateType
,HUGIN
,SHSH
)
51 UpdateType
Updates() const { return GetPropertyAs
<UpdateType
>("updates"); }
53 JTree() : DAIAlgRG(), _RTree(), _Qa(), _Qb(), _mes(), _logZ() {};
54 JTree( const JTree
& x
) : DAIAlgRG(x
), _RTree(x
._RTree
), _Qa(x
._Qa
), _Qb(x
._Qb
), _mes(x
._mes
), _logZ(x
._logZ
) {};
55 JTree
* clone() const { return new JTree(*this); }
56 JTree
& operator=( const JTree
& x
) {
58 DAIAlgRG::operator=(x
);
67 JTree( const FactorGraph
&fg
, const Properties
&opts
, bool automatic
=true );
68 void GenerateJT( const std::vector
<VarSet
> &Cliques
);
70 Factor
& message(size_t i1
, size_t i2
) { return( _mes
[ORIR2E(i1
,i2
)] ); }
71 const Factor
& message(size_t i1
, size_t i2
) const { return( _mes
[ORIR2E(i1
,i2
)] ); }
73 static const char *Name
;
74 std::string
identify() const;
77 assert( checkProperties() );
80 void runShaferShenoy();
82 Factor
belief( const Var
&n
) const;
83 Factor
belief( const VarSet
&ns
) const;
84 std::vector
<Factor
> beliefs() const;
87 void init( const VarSet
&/*ns*/ ) {}
88 void undoProbs( const VarSet
&ns
) { RegionGraph::undoProbs( ns
); init( ns
); }
90 size_t findEfficientTree( const VarSet
& ns
, DEdgeVec
&Tree
, size_t PreviousRoot
=(size_t)-1 ) const;
91 Factor
calcMarginal( const VarSet
& ns
);
92 bool checkProperties();
96 } // end of namespace dai