|  | 
| static DiscreteFactorGraph | gtsam::CollectDiscreteFactors (const HybridGaussianFactorGraph &factors) | 
|  | 
| static std::pair< HybridConditional::shared_ptr, std::shared_ptr< Factor > > | gtsam::continuousElimination (const HybridGaussianFactorGraph &factors, const Ordering &frontalKeys) | 
|  | 
| static std::shared_ptr< Factor > | gtsam::createDiscreteFactor (const ResultTree &eliminationResults, const DiscreteKeys &discreteSeparator) | 
|  | 
| static std::shared_ptr< Factor > | gtsam::createHybridGaussianFactor (const ResultTree &eliminationResults, const DiscreteKeys &discreteSeparator) | 
|  | 
| static std::pair< HybridConditional::shared_ptr, std::shared_ptr< Factor > > | gtsam::discreteElimination (const HybridGaussianFactorGraph &factors, const Ordering &frontalKeys) | 
|  | 
| static DiscreteFactor::shared_ptr | gtsam::DiscreteFactorFromErrors (const DiscreteKeys &discreteKeys, const AlgebraicDecisionTree< Key > &errors) | 
|  | Take negative log-values, shift them so that the minimum value is 0, and then exponentiate to create a TableFactor (not normalized yet!).  More... 
 | 
|  | 
| std::pair< HybridConditional::shared_ptr, std::shared_ptr< Factor > > | gtsam::EliminateHybrid (const HybridGaussianFactorGraph &factors, const Ordering &keys) | 
|  | Main elimination function for HybridGaussianFactorGraph.  More... 
 | 
|  | 
| const Ordering | gtsam::HybridOrdering (const HybridGaussianFactorGraph &graph) | 
|  | Return a Colamd constrained ordering where the discrete keys are eliminated after the continuous keys.  More... 
 | 
|  | 
| static void | gtsam::printFactor (const std::shared_ptr< Factor > &factor, const DiscreteValues &assignment, const KeyFormatter &keyFormatter) | 
|  | 
| static void | gtsam::throwRuntimeError (const std::string &s, const std::shared_ptr< Factor > &f) | 
|  | 
Hybrid factor graph that uses type erasure. 
- Author
- Fan Jiang 
- 
Varun Agrawal 
- 
Frank Dellaert 
- Date
- Mar 11, 2022 
Definition in file HybridGaussianFactorGraph.cpp.