COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
04/17/04 21:19:57 (17 years ago)
Author:
beckerjc
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@468
Message:

Kruskal lenyegeben kesz.
Kell meg dokumentalni, meg meg egy par jol hasznalhato wrapper fv.
Es valamit meg kene csinalni azzal, hogy nem const ref. a kimeno boolmap,

viszont sokszor "on-the-fly" akarjuk megkonstrualni (es ilyenkor persze a
const-os mapet is lehet set-elni...)

File:
1 edited

Legend:

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

    r246 r349  
    7272
    7373  cout << "Uniform 2-es koltseggel: "
    74        << kruskal1(G, edge_cost_map, tree_map)
     74       << Kruskal_EdgeCostMapIn_BoolMapOut(G, edge_cost_map, tree_map)
    7575       << endl;
    7676
     
    9090
    9191  cout << "Nemkonst koltseggel (-31): "
    92        << kruskal2(G, edge_cost_map, back_inserter(tree_edge_vec))
     92       << Kruskal_EdgeCostMapIn_IteratorOut(G, edge_cost_map,
     93                                            back_inserter(tree_edge_vec))
    9394       << endl;
    9495
    9596  int i = 1;
     97  for(vector<Edge>::iterator e = tree_edge_vec.begin();
     98      e != tree_edge_vec.end(); ++e, ++i) {
     99    cout << i << ". el: " << *e << endl;
     100  }
     101
     102  tree_edge_vec.clear();
     103  SequenceOutput< back_insert_iterator< vector<Edge> > >
     104    vec_filler(back_inserter(tree_edge_vec));
     105  cout << "Nemkonst koltseggel tarhatekonyabban: "
     106       << Kruskal(G,
     107                  KruskalMapVec<ECostMap>(G, edge_cost_map),
     108                  vec_filler)
     109       << endl;
     110
     111  i = 1;
    96112  for(vector<Edge>::iterator e = tree_edge_vec.begin();
    97113      e != tree_edge_vec.end(); ++e, ++i) {
Note: See TracChangeset for help on using the changeset viewer.