Changeset 246:dc95ca4ebc7b in lemon-0.x for src/work/johanna/kruskal_test.cc

Timestamp:

03/26/04 14:59:59 (20 years ago)

Author:

beckerjc

Branch:

default

Phase:

public

Convert:

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

Message:

koztes valtozat

File:

• src/work/johanna/kruskal_test.cc (modified) (2 diffs)

src/work/johanna/kruskal_test.cc

@@ -2 +2 @@
 #include <iostream>
 #include <map>
+#include <vector>
 
 #include <kruskal.h>
@@ -69 +70 @@
   EBoolMap tree_map(G);
   
-  typedef MinCostTreeKruskal<ListGraph, ECostMap, EBoolMap> MCTK;
 
-  MCTK mctk(G, edge_cost_map, tree_map);
-  double k0lts = mctk.run();
+  cout << "Uniform 2-es koltseggel: " 
+       << kruskal1(G, edge_cost_map, tree_map)
+       << endl;
 
-  cout << "Uniform 2-es koltseggel: " << k0lts << endl;
 
-  // Max koltsegu fa szamitasa elore megrendezett koltseg vektorbol:
-  typedef MinCostTreeKruskal<ListGraph, DummyMap<Edge,int>, EBoolMap> MCTK2;
-  MCTK2 mctk2(G, DummyMap<Edge,int>(), tree_map);
-  MCTK2::EdgeCostVector ecv;
-  ecv.push_back(make_pair(e1, 10));
-  ecv.push_back(make_pair(e2, 9));
-  ecv.push_back(make_pair(e3, 8));
-  ecv.push_back(make_pair(e4, 7));
-  ecv.push_back(make_pair(e5, 6));
-  ecv.push_back(make_pair(e6, 5));
-  ecv.push_back(make_pair(e7, 4));
-  ecv.push_back(make_pair(e8, 3));
-  ecv.push_back(make_pair(e9, 2));
-  ecv.push_back(make_pair(e10, 1));
+  edge_cost_map.set(e1, -10);
+  edge_cost_map.set(e2, -9);
+  edge_cost_map.set(e3, -8);
+  edge_cost_map.set(e4, -7);
+  edge_cost_map.set(e5, -6);
+  edge_cost_map.set(e6, -5);
+  edge_cost_map.set(e7, -4);
+  edge_cost_map.set(e8, -3);
+  edge_cost_map.set(e9, -2);
+  edge_cost_map.set(e10, -1);
 
-  k0lts = mctk2.run(ecv);
-  cout << "Max koltsegu fa elore megrendezett koltseg vektorbol: 31 = "
-       << k0lts << endl;
+  vector<Edge> tree_edge_vec;
+
+  cout << "Nemkonst koltseggel (-31): "
+       << kruskal2(G, edge_cost_map, back_inserter(tree_edge_vec))
+       << endl;
+
+  int i = 1;
+  for(vector<Edge>::iterator e = tree_edge_vec.begin();
+      e != tree_edge_vec.end(); ++e, ++i) {
+    cout << i << ". el: " << *e << endl;
+  }
+
+
+//   typedef MinCostTreeKruskal<ListGraph, ECostMap, EBoolMap> MCTK;
+
+//   MCTK mctk(G, edge_cost_map, tree_map);
+//   double k0lts = mctk.run();
+
+//   cout << "Uniform 2-es koltseggel: " << k0lts << endl;
+
+//   // Max koltsegu fa szamitasa elore megrendezett koltseg vektorbol:
+//   typedef MinCostTreeKruskal<ListGraph, DummyMap<Edge,int>, EBoolMap> MCTK2;
+//   MCTK2 mctk2(G, DummyMap<Edge,int>(), tree_map);
+//   MCTK2::EdgeCostVector ecv;
+//   ecv.push_back(make_pair(e1, 10));
+//   ecv.push_back(make_pair(e2, 9));
+//   ecv.push_back(make_pair(e3, 8));
+//   ecv.push_back(make_pair(e4, 7));
+//   ecv.push_back(make_pair(e5, 6));
+//   ecv.push_back(make_pair(e6, 5));
+//   ecv.push_back(make_pair(e7, 4));
+//   ecv.push_back(make_pair(e8, 3));
+//   ecv.push_back(make_pair(e9, 2));
+//   ecv.push_back(make_pair(e10, 1));
+
+//   k0lts = mctk2.run(ecv);
+//   cout << "Max koltsegu fa elore megrendezett koltseg vektorbol: 31 = "
+//        << k0lts << endl;