33 readDimacsMaxFlow(ins, G, s, t, cap); |
33 readDimacsMaxFlow(ins, G, s, t, cap); |
34 |
34 |
35 Timer ts; |
35 Timer ts; |
36 Graph::EdgeMap<int> flow(G); //0 flow |
36 Graph::EdgeMap<int> flow(G); //0 flow |
37 Preflow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > |
37 Preflow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > |
38 pre_flow_test(G, s, t, cap, flow); |
38 pre_flow_test(G, s, t, cap, flow, true); |
39 MaxFlow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > |
39 MaxFlow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > |
40 max_flow_test(G, s, t, cap, flow); |
40 max_flow_test(G, s, t, cap, flow); |
41 |
41 |
42 std::cout << "ListGraph ..." << std::endl; |
42 std::cout << "ListGraph ..." << std::endl; |
43 |
43 |
107 readDimacsMaxFlow(ins, G, s, t, cap); |
107 readDimacsMaxFlow(ins, G, s, t, cap); |
108 |
108 |
109 Timer ts; |
109 Timer ts; |
110 Graph::EdgeMap<int> flow(G); //0 flow |
110 Graph::EdgeMap<int> flow(G); //0 flow |
111 Preflow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > |
111 Preflow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > |
112 pre_flow_test(G, s, t, cap, flow); |
112 pre_flow_test(G, s, t, cap, flow, true); |
113 MaxFlow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > |
113 MaxFlow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > |
114 max_flow_test(G, s, t, cap, flow); |
114 max_flow_test(G, s, t, cap, flow); |
115 |
115 |
116 std::cout << "SmatrGraph ..." << std::endl; |
116 std::cout << "SmatrGraph ..." << std::endl; |
117 |
117 |