44 typedef std::map<Key, double> key2doubleMap;
45 typedef std::map<Key, Key> PredecessorMap;
52 const key2doubleMap& deltaThetaMap,
const PredecessorMap& tree);
63 std::vector<size_t>& spanningTreeIds, std::vector<size_t>& chordsIds,
64 key2doubleMap& deltaThetaMap,
65 const PredecessorMap& tree,
const NonlinearFactorGraph& g);
69 const std::vector<size_t>& spanningTreeIds,
70 const std::vector<size_t>& chordsIds,
const NonlinearFactorGraph& g,
71 const key2doubleMap& orientationsToRoot,
const PredecessorMap& tree);
78 const NonlinearFactorGraph& pose2Graph);
82 const NonlinearFactorGraph& graph,
bool useOdometricPath =
true);
86 bool useOdometricPath =
true);
90 const Values& initialGuess);
Factor Graph consisting of non-linear factors.
GTSAM_EXPORT VectorValues initializeOrientations(const NonlinearFactorGraph &graph, bool useOdometricPath=true)
Linear Factor Graph where all factors are Gaussians.
GTSAM_EXPORT void getSymbolicGraph(std::vector< size_t > &spanningTreeIds, std::vector< size_t > &chordsIds, key2doubleMap &deltaThetaMap, const PredecessorMap &tree, const NonlinearFactorGraph &g)
Definition: chartTesting.h:28
GTSAM_EXPORT Values initialize(const NonlinearFactorGraph &graph, bool useOdometricPath=true)
PredecessorMap< KEY > findMinimumSpanningTree(const G &fg)
Definition: graph-inl.h:222
GTSAM_EXPORT GaussianFactorGraph buildLinearOrientationGraph(const std::vector< size_t > &spanningTreeIds, const std::vector< size_t > &chordsIds, const NonlinearFactorGraph &g, const key2doubleMap &orientationsToRoot, const PredecessorMap &tree)
GTSAM_EXPORT key2doubleMap computeThetasToRoot(const key2doubleMap &deltaThetaMap, const PredecessorMap &tree)