equal
deleted
inserted
replaced
91 kruskal(g, edge_cost_map_2, std::back_inserter(tree_edge_vec)) <<std::endl; |
91 kruskal(g, edge_cost_map_2, std::back_inserter(tree_edge_vec)) <<std::endl; |
92 |
92 |
93 //The vector for the edges of the output tree. |
93 //The vector for the edges of the output tree. |
94 tree_edge_vec.clear(); |
94 tree_edge_vec.clear(); |
95 |
95 |
96 //Test with makeKruskalSequenceOutput and makeKruskalSequenceOutput. |
96 //Test with makeKruskalMapInput and makeKruskalSequenceOutput. |
97 |
97 |
98 std::cout << "The weight of the minimum spanning tree again is " << |
98 std::cout << "The weight of the minimum spanning tree again is " << |
99 kruskal(g,makeKruskalMapInput(g,edge_cost_map_2),makeKruskalSequenceOutput(std::back_inserter(tree_edge_vec)))<< std::endl; |
99 kruskal(g,makeKruskalMapInput(g,edge_cost_map_2),makeKruskalSequenceOutput(std::back_inserter(tree_edge_vec)))<< std::endl; |
100 |
100 |
101 |
101 |