COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
03/26/04 14:59:59 (16 years ago)
Author:
beckerjc
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@346
Message:

koztes valtozat

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/johanna/kruskal_test.cc

    r218 r246  
    22#include <iostream>
    33#include <map>
     4#include <vector>
    45
    56#include <kruskal.h>
     
    6970  EBoolMap tree_map(G);
    7071 
    71   typedef MinCostTreeKruskal<ListGraph, ECostMap, EBoolMap> MCTK;
    7272
    73   MCTK mctk(G, edge_cost_map, tree_map);
    74   double k0lts = mctk.run();
     73  cout << "Uniform 2-es koltseggel: "
     74       << kruskal1(G, edge_cost_map, tree_map)
     75       << endl;
    7576
    76   cout << "Uniform 2-es koltseggel: " << k0lts << endl;
    7777
    78   // Max koltsegu fa szamitasa elore megrendezett koltseg vektorbol:
    79   typedef MinCostTreeKruskal<ListGraph, DummyMap<Edge,int>, EBoolMap> MCTK2;
    80   MCTK2 mctk2(G, DummyMap<Edge,int>(), tree_map);
    81   MCTK2::EdgeCostVector ecv;
    82   ecv.push_back(make_pair(e1, 10));
    83   ecv.push_back(make_pair(e2, 9));
    84   ecv.push_back(make_pair(e3, 8));
    85   ecv.push_back(make_pair(e4, 7));
    86   ecv.push_back(make_pair(e5, 6));
    87   ecv.push_back(make_pair(e6, 5));
    88   ecv.push_back(make_pair(e7, 4));
    89   ecv.push_back(make_pair(e8, 3));
    90   ecv.push_back(make_pair(e9, 2));
    91   ecv.push_back(make_pair(e10, 1));
     78  edge_cost_map.set(e1, -10);
     79  edge_cost_map.set(e2, -9);
     80  edge_cost_map.set(e3, -8);
     81  edge_cost_map.set(e4, -7);
     82  edge_cost_map.set(e5, -6);
     83  edge_cost_map.set(e6, -5);
     84  edge_cost_map.set(e7, -4);
     85  edge_cost_map.set(e8, -3);
     86  edge_cost_map.set(e9, -2);
     87  edge_cost_map.set(e10, -1);
    9288
    93   k0lts = mctk2.run(ecv);
    94   cout << "Max koltsegu fa elore megrendezett koltseg vektorbol: 31 = "
    95        << k0lts << endl;
     89  vector<Edge> tree_edge_vec;
     90
     91  cout << "Nemkonst koltseggel (-31): "
     92       << kruskal2(G, edge_cost_map, back_inserter(tree_edge_vec))
     93       << endl;
     94
     95  int i = 1;
     96  for(vector<Edge>::iterator e = tree_edge_vec.begin();
     97      e != tree_edge_vec.end(); ++e, ++i) {
     98    cout << i << ". el: " << *e << endl;
     99  }
     100
     101
     102//   typedef MinCostTreeKruskal<ListGraph, ECostMap, EBoolMap> MCTK;
     103
     104//   MCTK mctk(G, edge_cost_map, tree_map);
     105//   double k0lts = mctk.run();
     106
     107//   cout << "Uniform 2-es koltseggel: " << k0lts << endl;
     108
     109//   // Max koltsegu fa szamitasa elore megrendezett koltseg vektorbol:
     110//   typedef MinCostTreeKruskal<ListGraph, DummyMap<Edge,int>, EBoolMap> MCTK2;
     111//   MCTK2 mctk2(G, DummyMap<Edge,int>(), tree_map);
     112//   MCTK2::EdgeCostVector ecv;
     113//   ecv.push_back(make_pair(e1, 10));
     114//   ecv.push_back(make_pair(e2, 9));
     115//   ecv.push_back(make_pair(e3, 8));
     116//   ecv.push_back(make_pair(e4, 7));
     117//   ecv.push_back(make_pair(e5, 6));
     118//   ecv.push_back(make_pair(e6, 5));
     119//   ecv.push_back(make_pair(e7, 4));
     120//   ecv.push_back(make_pair(e8, 3));
     121//   ecv.push_back(make_pair(e9, 2));
     122//   ecv.push_back(make_pair(e10, 1));
     123
     124//   k0lts = mctk2.run(ecv);
     125//   cout << "Max koltsegu fa elore megrendezett koltseg vektorbol: 31 = "
     126//        << k0lts << endl;
    96127
    97128
Note: See TracChangeset for help on using the changeset viewer.