COIN-OR::LEMON - Graph Library

source: lemon-0.x/src/work/proba.cc @ 23:a72cac00e274

Last change on this file since 23:a72cac00e274 was 23:a72cac00e274, checked in by jacint, 17 years ago

Test for the flow algorithms

File size: 6.0 KB
Line 
1#include <iostream>
2#include <vector>
3#include <string>
4
5#include <marci_list_graph.hh>
6#include <marci_graph_traits.hh>
7#include <marci_property_vector.hh>
8#include <preflow_push_hl.hh>
9#include <preflow_push_max_flow.hh>
10#include <reverse_bfs.hh>
11
12using namespace marci;
13
14
15int main (int, char*[])
16{
17  typedef graph_traits<list_graph>::node_iterator node_iterator;
18  typedef graph_traits<list_graph>::edge_iterator edge_iterator;
19  typedef graph_traits<list_graph>::each_node_iterator each_node_iterator;
20  typedef graph_traits<list_graph>::each_edge_iterator each_edge_iterator;
21  typedef graph_traits<list_graph>::out_edge_iterator out_edge_iterator;
22  typedef graph_traits<list_graph>::in_edge_iterator in_edge_iterator;
23  typedef graph_traits<list_graph>::sym_edge_iterator sym_edge_iterator;
24
25  list_graph flow_test;
26 
27  //Ahuja könyv példája, maxflowvalue=13
28  node_iterator s=flow_test.add_node();
29  node_iterator v1=flow_test.add_node();
30  node_iterator v2=flow_test.add_node();
31  node_iterator v3=flow_test.add_node();
32  node_iterator v4=flow_test.add_node();
33  node_iterator v5=flow_test.add_node();
34  node_iterator t=flow_test.add_node();
35 
36  node_property_vector<list_graph, std::string> node_name(flow_test);
37  node_name.put(s, "s");
38  node_name.put(v1, "v1");
39  node_name.put(v2, "v2");
40  node_name.put(v3, "v3");
41  node_name.put(v4, "v4");
42  node_name.put(v5, "v5");
43  node_name.put(t, "t");
44
45  edge_iterator s_v1=flow_test.add_edge(s, v1);
46  edge_iterator s_v2=flow_test.add_edge(s, v2);
47  edge_iterator s_v3=flow_test.add_edge(s, v3);
48 
49  edge_iterator v2_v4=flow_test.add_edge(v2, v4);
50  edge_iterator v2_v5=flow_test.add_edge(v2, v5);
51
52  edge_iterator v3_v5=flow_test.add_edge(v3, v5);
53
54  edge_iterator v4_t=flow_test.add_edge(v4, t);
55  edge_iterator v5_t=flow_test.add_edge(v5, t);
56 
57  edge_property_vector<list_graph, int> cap(flow_test); 
58  cap.put(s_v1, 0);
59  cap.put(s_v2, 10);
60  cap.put(s_v3, 10);
61  cap.put(v2_v4, 5);
62  cap.put(v2_v5, 8);
63  cap.put(v3_v5, 5);
64  cap.put(v4_t, 8);
65  cap.put(v5_t, 8);
66
67
68 
69  //Marci példája, maxflowvalue=23
70  /*   node_iterator s=flow_test.add_node();
71  node_iterator v1=flow_test.add_node();
72  node_iterator v2=flow_test.add_node();
73  node_iterator v3=flow_test.add_node();
74  node_iterator v4=flow_test.add_node();
75  node_iterator t=flow_test.add_node();
76  node_iterator w=flow_test.add_node();
77
78 
79  node_property_vector<list_graph, std::string> node_name(flow_test);
80  node_name.put(s, "s");
81  node_name.put(v1, "v1");
82  node_name.put(v2, "v2");
83  node_name.put(v3, "v3");
84  node_name.put(v4, "v4");
85  node_name.put(t, "t");
86  node_name.put(w, "w");
87
88  edge_iterator s_v1=flow_test.add_edge(s, v1);
89  edge_iterator s_v2=flow_test.add_edge(s, v2);
90  edge_iterator v1_v2=flow_test.add_edge(v1, v2);
91  edge_iterator v2_v1=flow_test.add_edge(v2, v1);
92  edge_iterator v1_v3=flow_test.add_edge(v1, v3);
93  edge_iterator v3_v2=flow_test.add_edge(v3, v2);
94  edge_iterator v2_v4=flow_test.add_edge(v2, v4);
95  edge_iterator v4_v3=flow_test.add_edge(v4, v3);
96  edge_iterator v3_t=flow_test.add_edge(v3, t);
97  edge_iterator v4_t=flow_test.add_edge(v4, t);
98  edge_iterator v3_v3=flow_test.add_edge(v3, v3);
99  edge_iterator s_w=flow_test.add_edge(s, w);
100 
101
102
103  edge_property_vector<list_graph, int> cap(flow_test); 
104  cap.put(s_v1, 16);
105  cap.put(s_v2, 13);
106  cap.put(v1_v2, 10);
107  cap.put(v2_v1, 4);
108  cap.put(v1_v3, 12);
109  cap.put(v3_v2, 9);
110  cap.put(v2_v4, 14);
111  cap.put(v4_v3, 7);
112  cap.put(v3_t, 20);
113  cap.put(v4_t, 4);
114  cap.put(v3_v3, 4);
115  cap.put(s_w, 4);
116  */
117
118
119  //pelda 3, maxflowvalue=4
120  /*    node_iterator s=flow_test.add_node();
121  node_iterator v1=flow_test.add_node();
122  node_iterator v2=flow_test.add_node();
123  node_iterator t=flow_test.add_node();
124  node_iterator w=flow_test.add_node();
125 
126  node_property_vector<list_graph, std::string> node_name(flow_test);
127  node_name.put(s, "s");
128  node_name.put(v1, "v1");
129  node_name.put(v2, "v2");
130  node_name.put(t, "t");
131  node_name.put(w, "w");
132
133  edge_iterator s_v1=flow_test.add_edge(s, v1);
134  edge_iterator v1_v2=flow_test.add_edge(v1, v2);
135  edge_iterator v2_t=flow_test.add_edge(v2, t);
136  edge_iterator v1_v1=flow_test.add_edge(v1, v1);
137  edge_iterator s_w=flow_test.add_edge(s, w);
138
139
140  edge_property_vector<list_graph, int> cap(flow_test);
141   
142  cap.put(s_v1, 16);
143  cap.put(v1_v2, 10);
144  cap.put(v2_t, 4);
145  cap.put(v1_v1, 3);
146  cap.put(s_w, 5);
147 
148  */
149
150
151
152  std::cout << "Testing reverse_bfs..." << std::endl;
153 
154  reverse_bfs<list_graph> bfs_test(flow_test, t);
155
156  bfs_test.run();
157
158  for (each_node_iterator w=flow_test.first_node(); w.is_valid(); ++w) {
159    std::cout <<"The distance of " << w << " is " << bfs_test.dist(w) <<std::endl;
160    }
161
162
163
164
165
166  std::cout << "Testing preflow_push_hl..." << std::endl;
167 
168  preflow_push_hl<list_graph, int> preflow_push_test(flow_test, s, t, cap);
169
170  preflow_push_test.run();
171
172  std::cout << "Maximum flow value is: " << preflow_push_test.maxflow() << "."<<std::endl;
173
174  std::cout<< "The flow on edge s-v1 is "<< preflow_push_test.flowonedge(s_v1) << "."<<std::endl;
175
176  edge_property_vector<list_graph, int> flow=preflow_push_test.allflow(); 
177  for (each_edge_iterator e=flow_test.first_edge(); e.is_valid(); ++e) {
178    std::cout <<"Flow on edge " << flow_test.tail(e) <<"-" << flow_test.head(e)<< " is " <<flow.get(e) <<std::endl;
179    }
180
181  std::cout << "A minimum cut: " <<std::endl; 
182  node_property_vector<list_graph, bool> mincut=preflow_push_test.mincut();
183
184  for (each_node_iterator v=flow_test.first_node(); v.is_valid(); ++v) {
185      if (mincut.get(v)) std::cout <<node_name.get(v)<< " ";
186    }
187 
188  std::cout<<"\n\n"<<std::endl;
189
190
191
192
193  std::cout << "Testing preflow_push_max_flow..." << std::endl;
194 
195  preflow_push_max_flow<list_graph, int> max_flow_test(flow_test, s, t, cap);
196
197  max_flow_test.run();
198
199  std::cout << "Maximum flow value is: " << max_flow_test.maxflow() << "."<< std::endl;
200
201  std::cout << "A minimum cut: " <<std::endl; 
202  node_property_vector<list_graph, bool> mincut2=max_flow_test.mincut();
203
204  for (each_node_iterator v=flow_test.first_node(); v.is_valid(); ++v) {
205    if (mincut2.get(v)) std::cout <<node_name.get(v)<< " ";
206  }
207 
208  std::cout << std::endl;
209
210
211
212  return 0;
213}
214
215
216
217
218
219
220
221
222
Note: See TracBrowser for help on using the repository browser.