COIN-OR::LEMON - Graph Library

source: lemon-0.x/src/work/marci/leda/bipartite_matching_leda_gen.cc @ 459:68e6873f421a

Last change on this file since 459:68e6873f421a was 459:68e6873f421a, checked in by marci, 17 years ago

dijstra const ref, misc

File size: 4.6 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 << "A bipartite graph is a random group graph if the color classes \nA and B are partitiones to A_0, A_1, ..., A_{k-1} and B_0, B_1, ..., B_{k-1} \nas equally as possible \nand the edges from A_i goes to A_{i-1 mod k} and A_{i+1 mod k}.\n";
79  std::cout << "number of groups in LEDA random group graph=";
80  std::cin >> k;
81
82  leda_list<leda_node> lS;
83  leda_list<leda_node> lT;
84  random_bigraph(lg, a, b, m, lS, lT, k);
85
86//   for (int i=0; i<a; ++i) s_nodes.push_back(g.addNode());
87//   for (int i=0; i<b; ++i) t_nodes.push_back(g.addNode());
88
89//   random_init();
90//   for(int i=0; i<m; ++i) {
91//     g.addEdge(s_nodes[random(a)], t_nodes[random(b)]);
92//   }
93
94  Graph::NodeMap<int> ref_map(g, -1);
95
96  IterableBoolMap< Graph::NodeMap<int> > bipartite_map(ref_map);
97//   for (int i=0; i<a; ++i) bipartite_map.insert(s_nodes[i], false);
98//   for (int i=0; i<b; ++i) bipartite_map.insert(t_nodes[i], true);
99  leda_node ln;
100  forall(ln, lS) bipartite_map.insert(ln, false);
101  forall(ln, lT) bipartite_map.insert(ln, true);
102
103  typedef BipartiteGraphWrapper<Graph> BGW;
104  BGW bgw(g, bipartite_map);
105
106  //  BGW::NodeMap<int> dbyj(bgw);
107  //  BGW::EdgeMap<int> dbyxcj(bgw);
108
109  typedef stGraphWrapper<BGW> stGW;
110  stGW stgw(bgw);
111  ConstMap<stGW::Edge, int> const1map(1);
112  stGW::EdgeMap<int> flow(stgw);
113
114  Timer ts;
115  FOR_EACH_LOC(stGW::EdgeIt, e, stgw) flow.set(e, 0);
116  ts.reset();
117  //  stGW::EdgeMap<int> pre_flow(stgw);
118  Preflow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> >
119    pre_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow/*, true*/);
120  pre_flow_test.run();
121  std::cout << "HUGO pre flow value: " << pre_flow_test.flowValue() << std::endl;
122  std::cout << "elapsed time: " << ts << std::endl;
123//   FOR_EACH_LOC(stGW::EdgeIt, e, stgw) {
124//     std::cout << e << ": " << pre_flow[e] << "\n";
125//   }
126  std::cout << "\n";
127
128  ts.reset(); 
129  leda_list<leda_edge> ml=MAX_CARD_BIPARTITE_MATCHING(lg);
130  //  stGW::EdgeMap<int> pre_flow(stgw);
131  //Preflow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> >
132  //  pre_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, pre_flow, true);
133  //pre_flow_test.run();
134  std::cout << "LEDA matching value: " << ml.size() << std::endl;
135  std::cout << "elapsed time: " << ts << std::endl;
136//   FOR_EACH_LOC(stGW::EdgeIt, e, stgw) {
137//     std::cout << e << ": " << pre_flow[e] << "\n";
138//   }
139  std::cout << "\n";
140
141  FOR_EACH_LOC(stGW::EdgeIt, e, stgw) flow.set(e, 0);
142  ts.reset();
143  MaxFlow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> >
144    max_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow);
145//  while (max_flow_test.augmentOnShortestPath()) { }
146  typedef ListGraph MutableGraph;
147//  while (max_flow_test.augmentOnBlockingFlow1<MutableGraph>()) {
148  while (max_flow_test.augmentOnBlockingFlow2()) {
149   std::cout << max_flow_test.flowValue() << std::endl;
150  }
151  std::cout << "HUGO blocking flow value: " << max_flow_test.flowValue() << std::endl;
152  std::cout << "elapsed time: " << ts << std::endl;
153//   FOR_EACH_LOC(stGW::EdgeIt, e, stgw) {
154//     std::cout << e << ": " << max_flow[e] << "\n";
155//   }
156//   std::cout << "\n";
157
158  return 0;
159}
Note: See TracBrowser for help on using the repository browser.