1.1 --- a/demo/kruskal_demo.cc Thu Jul 21 19:28:29 2005 +0000
1.2 +++ b/demo/kruskal_demo.cc Fri Jul 22 09:41:20 2005 +0000
1.3 @@ -93,7 +93,7 @@
1.4 //The vector for the edges of the output tree.
1.5 tree_edge_vec.clear();
1.6
1.7 - //Test with makeKruskalSequenceOutput and makeKruskalSequenceOutput.
1.8 + //Test with makeKruskalMapInput and makeKruskalSequenceOutput.
1.9
1.10 std::cout << "The weight of the minimum spanning tree again is " <<
1.11 kruskal(g,makeKruskalMapInput(g,edge_cost_map_2),makeKruskalSequenceOutput(std::back_inserter(tree_edge_vec)))<< std::endl;