equal
deleted
inserted
replaced
2 |
2 |
3 #include<math.h> |
3 #include<math.h> |
4 #include<hugo/list_graph.h> |
4 #include<hugo/list_graph.h> |
5 #include<hugo/smart_graph.h> |
5 #include<hugo/smart_graph.h> |
6 #include<hugo/dijkstra.h> |
6 #include<hugo/dijkstra.h> |
7 #include<hugo/max_flow.h> |
7 #include<hugo/preflow.h> |
8 |
8 |
9 #include"bench_tools.h" |
9 #include"bench_tools.h" |
10 |
10 |
11 using namespace std; |
11 using namespace std; |
12 using namespace hugo; |
12 using namespace hugo; |
89 |
89 |
90 T.reset(); |
90 T.reset(); |
91 { |
91 { |
92 Graph::EdgeMap<int> flow(G); |
92 Graph::EdgeMap<int> flow(G); |
93 |
93 |
94 MaxFlow<Graph,int> MF(G,nodes[0],nodes[1<<dim-1],map,flow); |
94 Preflow<Graph,int> MF(G,nodes[0],nodes[1<<dim-1],map,flow); |
95 for(int i=0;i<10;i++) |
95 for(int i=0;i<10;i++) |
96 MF.run(MF.NO_FLOW); |
96 MF.run(MF.NO_FLOW); |
97 } |
97 } |
98 PrintTime("PREFLOW",T); |
98 PrintTime("PREFLOW",T); |
99 |
99 |