We must run kruskal on the filtered graph to ignore the infinite vertex

2014-11-24 16:55:59 +01:00
parent a096cdf431
commit b281d86414
1 changed files with 1 additions and 1 deletions
@@ -75,7 +75,7 @@ main(int,char*[])

  // In the function call you can see a named parameter: vertex_index_map
   std::list<edge_descriptor> mst;
-   boost::kruskal_minimum_spanning_tree(t,
+   boost::kruskal_minimum_spanning_tree(ft,
 					std::back_inserter(mst),
 					vertex_index_map(vertex_index_pmap));