1.1 --- a/test/kruskal_test.cc Sun Jun 15 22:03:33 2008 +0200
1.2 +++ b/test/kruskal_test.cc Sun Jun 15 22:05:23 2008 +0200
1.3 @@ -28,7 +28,6 @@
1.4 #include <lemon/concepts/digraph.h>
1.5 #include <lemon/concepts/graph.h>
1.6
1.7 -
1.8 using namespace std;
1.9 using namespace lemon;
1.10
1.11 @@ -57,7 +56,6 @@
1.12
1.13 kruskal(g, r, ws.begin());
1.14 kruskal(ug, ur, uws.begin());
1.15 -
1.16 }
1.17
1.18 int main() {
1.19 @@ -97,7 +95,7 @@
1.20 //Test with const map.
1.21 check(kruskal(G, ConstMap<ListGraph::Edge,int>(2), tree_map)==10,
1.22 "Total cost should be 10");
1.23 - //Test with a edge map (filled with uniform costs).
1.24 + //Test with an edge map (filled with uniform costs).
1.25 check(kruskal(G, edge_cost_map, tree_map)==10,
1.26 "Total cost should be 10");
1.27