COIN-OR::LEMON - Graph Library

source: lemon-0.x/src/work/alpar/f_ed_ka_demo.cc @ 117:67253d52b284

Last change on this file since 117:67253d52b284 was 117:67253d52b284, checked in by Alpar Juttner, 17 years ago

Timer class for measuring user/system time added.

File size: 1.2 KB
Line 
1#include <iostream>
2#include <fstream>
3
4#include "smart_graph.h"
5
6#include "../list_graph.hh"
7#include "../marci/dimacs.hh"
8#include "f_ed_ka.h"
9#include "../marci/time_measure.h"
10
11using namespace hugo;
12
13// Use a DIMACS max flow file as stdin.
14// read_dimacs_demo < dimacs_max_flow_file
15
16int main(int, char **) {
17  typedef SmartGraph Graph;
18  //typedef ListGraph Graph;
19
20  typedef Graph::NodeIt NodeIt;
21  typedef Graph::EachNodeIt EachNodeIt;
22  typedef Graph::EachEdgeIt EachEdgeIt;
23
24  Graph G;
25  NodeIt s, t;
26  Graph::DynEdgeMap<int> cap(G);
27  readDimacsMaxFlow(std::cin, G, s, t, cap);
28
29  std::cout << "edmonds karp demo..." << std::endl;
30  Graph::DynEdgeMap<int> flow(G); //0 flow
31 
32  int ret;
33  double pre_time=currTime();
34  Timer ts;
35 
36  ret = maxFlow(G,flow,cap,s,t);
37  double post_time=currTime();
38  std::cout << "ellapsed time:" << ts << std::endl;
39
40  //std::cout << "maximum flow: "<< std::endl;
41  //for(EachEdgeIt e=G.first<EachEdgeIt>(); e.valid(); ++e) {
42  //  std::cout<<"("<<G.tail(e)<< "-"<<flow.get(e)<<"->"<<G.head(e)<<") ";
43  //}
44  //std::cout<<std::endl;
45  std::cout << "elapsed time: " << post_time-pre_time << " sec"<< std::endl;
46  std::cout << "flow value: "<< ret << std::endl;
47
48  return 0;
49}
Note: See TracBrowser for help on using the repository browser.