12345qiupeng
/
gtsam
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

simplified code findMinimumSpanningTree

release/4.3a0
Luca 2014-05-15 13:49:57 -04:00
parent ffe8ea5399
commit a93299f2dc
1 changed files with 3 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
gtsam/inference/graph-inl.h
View File

@ -243,13 +243,12 @@ PredecessorMap<KEY> findMinimumSpanningTree(const G& fg) {
// convert edge to string pairs // convert edge to string pairs
PredecessorMap<KEY> tree; PredecessorMap<KEY> tree;
typename SDGraph<KEY>::vertex_iterator itVertex = boost::vertices(g).first; typename SDGraph<KEY>::vertex_iterator itVertex = boost::vertices(g).first;
typename std::vector<typename SDGraph<KEY>::Vertex>::iterator vi; BOOST_FOREACH(const typename SDGraph<KEY>::Vertex& vi, p_map){
for (vi = p_map.begin(); vi != p_map.end(); itVertex++, vi++) {
KEY key = boost::get(boost::vertex_name, g, *itVertex); KEY key = boost::get(boost::vertex_name, g, *itVertex);
KEY parent = boost::get(boost::vertex_name, g, *vi); KEY parent = boost::get(boost::vertex_name, g, vi);
tree.insert(key, parent); tree.insert(key, parent);
itVertex++;
} }
return tree; return tree;
} }