COIN-OR::LEMON - Graph Library

source: lemon-0.x/src/work/alpar/f_ed_ka_demo.cc @ 103:063de9e1be98

Last change on this file since 103:063de9e1be98 was 103:063de9e1be98, checked in by Alpar Juttner, 18 years ago

.

File size: 1.1 KB
RevLine 
[74]1#include <iostream>
2#include <fstream>
3
[103]4#include "smart_graph.h"
5
[74]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 marci;
12
13// Use a DIMACS max flow file as stdin.
14// read_dimacs_demo < dimacs_max_flow_file
15
16int main(int, char **) {
[103]17  //  typedef SmartGraph Graph;
18  typedef ListGraph Graph;
[74]19
[103]20  typedef Graph::NodeIt NodeIt;
21  typedef Graph::EachNodeIt EachNodeIt;
22  typedef Graph::EachEdgeIt EachEdgeIt;
23
24  Graph G;
[95]25  NodeIt s, t;
[103]26  Graph::EdgeMap<int> cap(G);
[74]27  readDimacsMaxFlow(std::cin, G, s, t, cap);
28
29  std::cout << "edmonds karp demo..." << std::endl;
[103]30  Graph::EdgeMap<int> flow(G); //0 flow
[74]31 
32  int ret;
33  double pre_time=currTime();
34  ret = maxFlow(G,flow,cap,s,t);
35  double post_time=currTime();
36  //std::cout << "maximum flow: "<< std::endl;
37  //for(EachEdgeIt e=G.first<EachEdgeIt>(); e.valid(); ++e) {
38  //  std::cout<<"("<<G.tail(e)<< "-"<<flow.get(e)<<"->"<<G.head(e)<<") ";
39  //}
40  //std::cout<<std::endl;
41  std::cout << "elapsed time: " << post_time-pre_time << " sec"<< std::endl;
42  std::cout << "flow value: "<< ret << std::endl;
43
44  return 0;
45}
Note: See TracBrowser for help on using the repository browser.