COIN-OR::LEMON - Graph Library

source: lemon-0.x/src/work/marci/leda/bipartite_matching_leda_gen.cc @ 446:77ef5c7a57d9

Last change on this file since 446:77ef5c7a57d9 was 446:77ef5c7a57d9, checked in by marci, 18 years ago

comparison for matchings with leda

File size: 4.4 KB
Line 
1// -*- c++ -*-
2#include <iostream>
3#include <fstream>
4#include <vector>
5#include <cstdlib>
6
7#include <LEDA/graph.h>
8#include <LEDA/mcb_matching.h>
9#include <LEDA/list.h>
10#include <LEDA/graph_gen.h>
11
12#include <leda_graph_wrapper.h>
13#include <list_graph.h>
14//#include <smart_graph.h>
15//#include <dimacs.h>
16#include <time_measure.h>
17#include <for_each_macros.h>
18//#include <bfs_iterator.h>
19#include <graph_wrapper.h>
20#include <maps.h>
21#include <edmonds_karp.h>
22#include <preflow.h>
23
24/**
25 * Inicializalja a veletlenszamgeneratort.
26 * Figyelem, ez nem jo igazi random szamokhoz,
27 * erre ne bizzad a titkaidat!
28 */
29void random_init()
30{
31        unsigned int seed = getpid();
32        seed |= seed << 15;
33        seed ^= time(0);
34
35        srand(seed);
36}
37
38/**
39 * Egy veletlen int-et ad vissza 0 es m-1 kozott.
40 */
41int random(int m)
42{
43  return int( double(m) * rand() / (RAND_MAX + 1.0) );
44}
45
46using namespace hugo;
47
48int main() {
49  //for leda graph
50  leda::graph lg;
51  //lg.make_undirected();
52  typedef LedaGraphWrapper<leda::graph> Graph;
53  Graph g(lg);
54
55  //for UndirListGraph
56  //typedef UndirListGraph Graph;
57  //Graph g;
58
59  typedef Graph::Node Node;
60  typedef Graph::NodeIt NodeIt;
61  typedef Graph::Edge Edge;
62  typedef Graph::EdgeIt EdgeIt;
63  typedef Graph::OutEdgeIt OutEdgeIt;
64
65  std::vector<Graph::Node> s_nodes;
66  std::vector<Graph::Node> t_nodes;
67
68  int a;
69  std::cout << "number of nodes in the first color class=";
70  std::cin >> a;
71  int b;
72  std::cout << "number of nodes in the second color class=";
73  std::cin >> b;
74  int m;
75  std::cout << "number of edges=";
76  std::cin >> m;
77  int k;
78  std::cout << "number of groups in LEDA random group graph=";
79  std::cin >> k;
80
81  leda_list<leda_node> lS;
82  leda_list<leda_node> lT;
83  random_bigraph(lg, a, b, m, lS, lT, k);
84
85//   for (int i=0; i<a; ++i) s_nodes.push_back(g.addNode());
86//   for (int i=0; i<b; ++i) t_nodes.push_back(g.addNode());
87
88//   random_init();
89//   for(int i=0; i<m; ++i) {
90//     g.addEdge(s_nodes[random(a)], t_nodes[random(b)]);
91//   }
92
93  Graph::NodeMap<int> ref_map(g, -1);
94
95  IterableBoolMap< Graph::NodeMap<int> > bipartite_map(ref_map);
96//   for (int i=0; i<a; ++i) bipartite_map.insert(s_nodes[i], false);
97//   for (int i=0; i<b; ++i) bipartite_map.insert(t_nodes[i], true);
98  leda_node ln;
99  forall(ln, lS) bipartite_map.insert(ln, false);
100  forall(ln, lT) bipartite_map.insert(ln, true);
101
102  typedef BipartiteGraphWrapper<Graph> BGW;
103  BGW bgw(g, bipartite_map);
104
105  //  BGW::NodeMap<int> dbyj(bgw);
106  //  BGW::EdgeMap<int> dbyxcj(bgw);
107
108  typedef stGraphWrapper<BGW> stGW;
109  stGW stgw(bgw);
110  ConstMap<stGW::Edge, int> const1map(1);
111  stGW::EdgeMap<int> flow(stgw);
112
113  Timer ts;
114  FOR_EACH_LOC(stGW::EdgeIt, e, stgw) flow.set(e, 0);
115  ts.reset();
116  //  stGW::EdgeMap<int> pre_flow(stgw);
117  Preflow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> >
118    pre_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow, true);
119  pre_flow_test.run();
120  std::cout << "HUGO pre flow value: " << pre_flow_test.flowValue() << std::endl;
121  std::cout << "elapsed time: " << ts << std::endl;
122//   FOR_EACH_LOC(stGW::EdgeIt, e, stgw) {
123//     std::cout << e << ": " << pre_flow[e] << "\n";
124//   }
125  std::cout << "\n";
126
127  ts.reset(); 
128  leda_list<leda_edge> ml=MAX_CARD_BIPARTITE_MATCHING(lg);
129  //  stGW::EdgeMap<int> pre_flow(stgw);
130  //Preflow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> >
131  //  pre_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, pre_flow, true);
132  //pre_flow_test.run();
133  std::cout << "LEDA matching value: " << ml.size() << std::endl;
134  std::cout << "elapsed time: " << ts << std::endl;
135//   FOR_EACH_LOC(stGW::EdgeIt, e, stgw) {
136//     std::cout << e << ": " << pre_flow[e] << "\n";
137//   }
138  std::cout << "\n";
139
140  FOR_EACH_LOC(stGW::EdgeIt, e, stgw) flow.set(e, 0);
141  ts.reset();
142  MaxFlow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> >
143    max_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow);
144//  while (max_flow_test.augmentOnShortestPath()) { }
145  typedef ListGraph MutableGraph;
146//  while (max_flow_test.augmentOnBlockingFlow1<MutableGraph>()) {
147  while (max_flow_test.augmentOnBlockingFlow2()) {
148   std::cout << max_flow_test.flowValue() << std::endl;
149  }
150  std::cout << "HUGO blocking flow value: " << max_flow_test.flowValue() << std::endl;
151  std::cout << "elapsed time: " << ts << std::endl;
152//   FOR_EACH_LOC(stGW::EdgeIt, e, stgw) {
153//     std::cout << e << ": " << max_flow[e] << "\n";
154//   }
155//   std::cout << "\n";
156
157  return 0;
158}
Note: See TracBrowser for help on using the repository browser.