Changeset 1557:3e8d928e283d in lemon-0.x for test/kruskal_test.cc

Timestamp:

07/14/05 14:23:15 (19 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2053

Message:

Each version of Kruskal is called the same ( kruskal(g,in,out) ) independently
from the input source and the output type.

File:

• test/kruskal_test.cc (modified) (3 diffs)

test/kruskal_test.cc

@@ -33 +33 @@
   concept::WriteMap<concept::StaticGraph::Edge,bool> w;
 
-  kruskalEdgeMap(concept::StaticGraph(),
-                 concept::ReadMap<concept::StaticGraph::Edge,int>(),
-                 w);
+  kruskal(concept::StaticGraph(),
+          concept::ReadMap<concept::StaticGraph::Edge,int>(),
+          w);
 }
 
@@ -73 +73 @@
 
   //Test with const map.
-  check(kruskalEdgeMap(G, ConstMap<ListGraph::Edge,int>(2), tree_map)==10,
+  check(kruskal(G, ConstMap<ListGraph::Edge,int>(2), tree_map)==10,
         "Total cost should be 10");
   //Test with a edge map (filled with uniform costs).
-  check(kruskalEdgeMap(G, edge_cost_map, tree_map)==10,
+  check(kruskal(G, edge_cost_map, tree_map)==10,
         "Total cost should be 10");
 
@@ -90 +90 @@
   edge_cost_map.set(e10, -1);
 
-  vector<Edge> tree_edge_vec;
+  vector<Edge> tree_edge_vec(5);
 
   //Test with a edge map and inserter.
-  check(kruskalEdgeMap_IteratorOut(G, edge_cost_map,
-                                   back_inserter(tree_edge_vec))
+  check(kruskal(G, edge_cost_map,
+                 tree_edge_vec.begin())
         ==-31,
         "Total cost should be -31.");
-
+  
   tree_edge_vec.clear();
 
+  check(kruskal(G, edge_cost_map,
+                back_inserter(tree_edge_vec))
+        ==-31,
+        "Total cost should be -31.");
+  
+  tree_edge_vec.clear();
+  
   //The above test could also be coded like this:
   check(kruskal(G,