|
template<class G , class Factor , class POSE , class KEY > |
std::shared_ptr< Values > | gtsam::composePoses (const G &graph, const PredecessorMap< KEY > &tree, const POSE &rootPose) |
|
template<class G , class KEY , class FACTOR2 > |
PredecessorMap< KEY > | gtsam::findMinimumSpanningTree (const G &fg) |
|
template<class G , class V , class KEY > |
std::tuple< G, V, std::map< KEY, V > > | gtsam::predecessorMap2Graph (const PredecessorMap< KEY > &p_map) |
|
template<class KEY > |
std::list< KEY > | gtsam::predecessorMap2Keys (const PredecessorMap< KEY > &p_map) |
|
template<class G , class KEY , class FACTOR2 > |
void | gtsam::split (const G &g, const PredecessorMap< KEY > &tree, G &Ab1, G &Ab2) |
|
template<class G , class F , class KEY > |
SDGraph< KEY > | gtsam::toBoostGraph (const G &graph) |
|
Graph algorithm using boost library.
- Author
- : Kai Ni
- Date
- Jan 11, 2010
Definition in file graph.h.