Changeset 1557:3e8d928e283d in lemon0.x for test
 Timestamp:
 07/14/05 14:23:15 (16 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2053
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

test/kruskal_test.cc
r1435 r1557 33 33 concept::WriteMap<concept::StaticGraph::Edge,bool> w; 34 34 35 kruskal EdgeMap(concept::StaticGraph(),36 37 35 kruskal(concept::StaticGraph(), 36 concept::ReadMap<concept::StaticGraph::Edge,int>(), 37 w); 38 38 } 39 39 … … 73 73 74 74 //Test with const map. 75 check(kruskal EdgeMap(G, ConstMap<ListGraph::Edge,int>(2), tree_map)==10,75 check(kruskal(G, ConstMap<ListGraph::Edge,int>(2), tree_map)==10, 76 76 "Total cost should be 10"); 77 77 //Test with a edge map (filled with uniform costs). 78 check(kruskal EdgeMap(G, edge_cost_map, tree_map)==10,78 check(kruskal(G, edge_cost_map, tree_map)==10, 79 79 "Total cost should be 10"); 80 80 … … 90 90 edge_cost_map.set(e10, 1); 91 91 92 vector<Edge> tree_edge_vec ;92 vector<Edge> tree_edge_vec(5); 93 93 94 94 //Test with a edge map and inserter. 95 check(kruskal EdgeMap_IteratorOut(G, edge_cost_map,96 back_inserter(tree_edge_vec))95 check(kruskal(G, edge_cost_map, 96 tree_edge_vec.begin()) 97 97 ==31, 98 98 "Total cost should be 31."); 99 99 100 100 tree_edge_vec.clear(); 101 101 102 check(kruskal(G, edge_cost_map, 103 back_inserter(tree_edge_vec)) 104 ==31, 105 "Total cost should be 31."); 106 107 tree_edge_vec.clear(); 108 102 109 //The above test could also be coded like this: 103 110 check(kruskal(G,
Note: See TracChangeset
for help on using the changeset viewer.