1 | #include <iostream> |
---|
2 | #include <fstream> |
---|
3 | |
---|
4 | #include <list_graph.hh> |
---|
5 | #include <dimacs.hh> |
---|
6 | #include <edmonds_karp.hh> |
---|
7 | #include <time_measure.h> |
---|
8 | |
---|
9 | using namespace hugo; |
---|
10 | |
---|
11 | // Use a DIMACS max flow file as stdin. |
---|
12 | // read_dimacs_demo < dimacs_max_flow_file |
---|
13 | |
---|
14 | /* |
---|
15 | struct Ize { |
---|
16 | }; |
---|
17 | |
---|
18 | struct Mize { |
---|
19 | Ize bumm; |
---|
20 | }; |
---|
21 | |
---|
22 | template <typename B> |
---|
23 | class Huha { |
---|
24 | public: |
---|
25 | int u; |
---|
26 | B brr; |
---|
27 | }; |
---|
28 | */ |
---|
29 | |
---|
30 | int main(int, char **) { |
---|
31 | typedef ListGraph::NodeIt NodeIt; |
---|
32 | typedef ListGraph::EachEdgeIt EachEdgeIt; |
---|
33 | |
---|
34 | /* |
---|
35 | Mize mize[10]; |
---|
36 | Mize bize[0]; |
---|
37 | Mize zize; |
---|
38 | typedef Mize Tize[0]; |
---|
39 | |
---|
40 | std::cout << &zize << " " << sizeof(mize) << sizeof(Tize) << std::endl; |
---|
41 | std::cout << sizeof(bize) << std::endl; |
---|
42 | |
---|
43 | |
---|
44 | Huha<Tize> k; |
---|
45 | std::cout << sizeof(k) << std::endl; |
---|
46 | */ |
---|
47 | |
---|
48 | ListGraph G; |
---|
49 | NodeIt s, t; |
---|
50 | ListGraph::EdgeMap<int> cap(G); |
---|
51 | readDimacsMaxFlow(std::cin, G, s, t, cap); |
---|
52 | |
---|
53 | { |
---|
54 | std::cout << "edmonds karp demo (blocking flow augmentation)..." << std::endl; |
---|
55 | ListGraph::EdgeMap<int> flow(G); //0 flow |
---|
56 | |
---|
57 | Timer ts; |
---|
58 | ts.reset(); |
---|
59 | //double pre_time=currTime(); |
---|
60 | MaxFlow<ListGraph, int, ListGraph::EdgeMap<int>, ListGraph::EdgeMap<int> > max_flow_test(G, s, t, flow, cap); |
---|
61 | //max_flow_test.augmentWithBlockingFlow<ListGraph>(); |
---|
62 | int i=0; |
---|
63 | while (max_flow_test.augmentOnBlockingFlow<ListGraph>()) { ++i; } |
---|
64 | //double post_time=currTime(); |
---|
65 | |
---|
66 | //std::cout << "maximum flow: "<< std::endl; |
---|
67 | //for(EachEdgeIt e=G.first<EachEdgeIt>(); e.valid(); ++e) { |
---|
68 | // std::cout<<"("<<G.tail(e)<< "-"<<flow.get(e)<<"->"<<G.head(e)<<") "; |
---|
69 | //} |
---|
70 | //std::cout<<std::endl; |
---|
71 | std::cout << "elapsed time: " << ts << std::endl; |
---|
72 | std::cout << "number of augmentation phases: " << i << std::endl; |
---|
73 | std::cout << "flow value: "<< max_flow_test.flowValue() << std::endl; |
---|
74 | } |
---|
75 | |
---|
76 | { |
---|
77 | std::cout << "edmonds karp demo (shortest path augmentation)..." << std::endl; |
---|
78 | ListGraph::EdgeMap<int> flow(G); //0 flow |
---|
79 | |
---|
80 | Timer ts; |
---|
81 | ts.reset(); |
---|
82 | //double pre_time=currTime(); |
---|
83 | MaxFlow<ListGraph, int, ListGraph::EdgeMap<int>, ListGraph::EdgeMap<int> > max_flow_test(G, s, t, flow, cap); |
---|
84 | //max_flow_test.augmentWithBlockingFlow<ListGraph>(); |
---|
85 | int i=0; |
---|
86 | while (max_flow_test.augmentOnShortestPath()) { ++i; } |
---|
87 | //double post_time=currTime(); |
---|
88 | |
---|
89 | //std::cout << "maximum flow: "<< std::endl; |
---|
90 | //for(EachEdgeIt e=G.first<EachEdgeIt>(); e.valid(); ++e) { |
---|
91 | // std::cout<<"("<<G.tail(e)<< "-"<<flow.get(e)<<"->"<<G.head(e)<<") "; |
---|
92 | //} |
---|
93 | //std::cout<<std::endl; |
---|
94 | std::cout << "elapsed time: " << ts << std::endl; |
---|
95 | std::cout << "number of augmentation phases: " << i << std::endl; |
---|
96 | std::cout << "flow value: "<< max_flow_test.flowValue() << std::endl; |
---|
97 | } |
---|
98 | |
---|
99 | return 0; |
---|
100 | } |
---|