Merged var.h and varset.h from SVN head

[libdai.git] / src / jtree.cpp

diff --git a/src/jtree.cpp b/src/jtree.cpp
index b846d35..c7652e1 100644 (file)
--- a/src/jtree.cpp
+++ b/src/jtree.cpp
@@ -338,7 +338,7 @@ size_t JTree::findEfficientTree( const VarSet& ns, DEdgeVec &Tree, size_t Previo
         // find first occurence of *n in the tree, which is closest to the root
         size_t e = 0;
         for( ; e != newTree.size(); e++ ) {
-            if( OR(newTree[e].n2).vars() && *n )
+            if( OR(newTree[e].n2).vars().contains( *n ) )
                 break;
         }
         assert( e != newTree.size() );