Search for k-best in factor graph

gtsam/discrete/DiscreteJunctionTree.cpp

@@ -16,19 +16,35 @@
  * @author Richard Roberts
  */
 
-#include <gtsam/inference/JunctionTree-inst.h>
-#include <gtsam/discrete/DiscreteJunctionTree.h>
 #include <gtsam/discrete/DiscreteEliminationTree.h>
+#include <gtsam/discrete/DiscreteJunctionTree.h>
+#include <gtsam/inference/JunctionTree-inst.h>
 
 namespace gtsam {
 
-  // Instantiate base classes
-  template class EliminatableClusterTree<DiscreteBayesTree, DiscreteFactorGraph>;
-  template class JunctionTree<DiscreteBayesTree, DiscreteFactorGraph>;
-
-  /* ************************************************************************* */
-  DiscreteJunctionTree::DiscreteJunctionTree(
-    const DiscreteEliminationTree& eliminationTree) :
-  Base(eliminationTree) {}
-
+// Instantiate base classes
+template class EliminatableClusterTree<DiscreteBayesTree, DiscreteFactorGraph>;
+template class JunctionTree<DiscreteBayesTree, DiscreteFactorGraph>;
+
+/* ************************************************************************* */
+DiscreteJunctionTree::DiscreteJunctionTree(
+    const DiscreteEliminationTree& eliminationTree)
+    : Base(eliminationTree) {}
+/* ************************************************************************* */
+
+void DiscreteJunctionTree::print(const std::string& s,
+                                 const KeyFormatter& keyFormatter) const {
+  auto visitor = [&keyFormatter](
+                     const std::shared_ptr<DiscreteJunctionTree::Cluster>& node,
+                     const std::string& parentString) {
+    // Print the current node
+    node->print(parentString + "-", keyFormatter);
+    node->factors.print(parentString + "-", keyFormatter);
+    std::cout << std::endl;
+    return parentString + "| ";  // Increment the indentation
+  };
+  std::string parentString = s;
+  treeTraversal::DepthFirstForest(*this, parentString, visitor);
 }
+
+}  // namespace gtsam

gtsam/discrete/DiscreteJunctionTree.h

@@ -18,54 +18,71 @@
 
 #pragma once
 
-#include <gtsam/discrete/DiscreteFactorGraph.h>
 #include <gtsam/discrete/DiscreteBayesTree.h>
+#include <gtsam/discrete/DiscreteFactorGraph.h>
 #include <gtsam/inference/JunctionTree.h>
 
 namespace gtsam {
 
-  // Forward declarations
-  class DiscreteEliminationTree;
+// Forward declarations
+class DiscreteEliminationTree;
+
+/**
+ * An EliminatableClusterTree, i.e., a set of variable clusters with factors,
+ * arranged in a tree, with the additional property that it represents the
+ * clique tree associated with a Bayes net.
+ *
+ * In GTSAM a junction tree is an intermediate data structure in multifrontal
+ * variable elimination.  Each node is a cluster of factors, along with a
+ * clique of variables that are eliminated all at once. In detail, every node k
+ * represents a clique (maximal fully connected subset) of an associated chordal
+ * graph, such as a chordal Bayes net resulting from elimination.
+ *
+ * The difference with the BayesTree is that a JunctionTree stores factors,
+ * whereas a BayesTree stores conditionals, that are the product of eliminating
+ * the factors in the corresponding JunctionTree cliques.
+ *
+ * The tree structure and elimination method are exactly analogous to the
+ * EliminationTree, except that in the JunctionTree, at each node multiple
+ * variables are eliminated at a time.
+ *
+ * \ingroup Multifrontal
+ * @ingroup discrete
+ * \nosubgrouping
+ */
+class GTSAM_EXPORT DiscreteJunctionTree
+    : public JunctionTree<DiscreteBayesTree, DiscreteFactorGraph> {
+ public:
+  typedef JunctionTree<DiscreteBayesTree, DiscreteFactorGraph>
+      Base;                                  ///< Base class
+  typedef DiscreteJunctionTree This;         ///< This class
+  typedef std::shared_ptr<This> shared_ptr;  ///< Shared pointer to this class
+
+  /// @name Constructors
+  /// @{
 
   /**
-   * An EliminatableClusterTree, i.e., a set of variable clusters with factors, arranged in a tree,
-   * with the additional property that it represents the clique tree associated with a Bayes net.
-   *
-   * In GTSAM a junction tree is an intermediate data structure in multifrontal
-   * variable elimination.  Each node is a cluster of factors, along with a
-   * clique of variables that are eliminated all at once. In detail, every node k represents
-   * a clique (maximal fully connected subset) of an associated chordal graph, such as a
-   * chordal Bayes net resulting from elimination.
-   *
-   * The difference with the BayesTree is that a JunctionTree stores factors, whereas a
-   * BayesTree stores conditionals, that are the product of eliminating the factors in the
-   * corresponding JunctionTree cliques.
-   *
-   * The tree structure and elimination method are exactly analogous to the EliminationTree,
-   * except that in the JunctionTree, at each node multiple variables are eliminated at a time.
-   *
-   * \ingroup Multifrontal
-   * @ingroup discrete
-   * \nosubgrouping
+   * Build the elimination tree of a factor graph using precomputed column
+   * structure.
+   * @param factorGraph The factor graph for which to build the elimination tree
+   * @param structure The set of factors involving each variable.  If this is
+   * not precomputed, you can call the Create(const FactorGraph<DERIVEDFACTOR>&)
+   * named constructor instead.
+   * @return The elimination tree
    */
-  class GTSAM_EXPORT DiscreteJunctionTree :
-    public JunctionTree<DiscreteBayesTree, DiscreteFactorGraph> {
-  public:
-    typedef JunctionTree<DiscreteBayesTree, DiscreteFactorGraph> Base; ///< Base class
-    typedef DiscreteJunctionTree This; ///< This class
-    typedef std::shared_ptr<This> shared_ptr; ///< Shared pointer to this class
+  DiscreteJunctionTree(const DiscreteEliminationTree& eliminationTree);
+
+  /// @}
+  /// @name Testable
+  /// @{
+
+  /** Print the tree to cout */
+  void print(const std::string& name = "DiscreteJunctionTree: ",
+             const KeyFormatter& formatter = DefaultKeyFormatter) const;
 
-    /**
-    * Build the elimination tree of a factor graph using precomputed column structure.
-    * @param factorGraph The factor graph for which to build the elimination tree
-    * @param structure The set of factors involving each variable.  If this is not
-    * precomputed, you can call the Create(const FactorGraph<DERIVEDFACTOR>&)
-    * named constructor instead.
-    * @return The elimination tree
-    */
-    DiscreteJunctionTree(const DiscreteEliminationTree& eliminationTree);
-  };
+  /// @}
+};
 
-  /// typedef for wrapper:
-  using DiscreteCluster = DiscreteJunctionTree::Cluster;
-}
+/// typedef for wrapper:
+using DiscreteCluster = DiscreteJunctionTree::Cluster;
+}  // namespace gtsam