#include <iostream>

#include <string>

#include <boost/config.hpp>

#include <boost/graph/edmunds_karp_max_flow.hpp>

#include <boost/graph/adjacency_list.hpp>

#include <boost/graph/read_dimacs.hpp>

#include <boost/graph/graph_utility.hpp>

#include <time_measure.h>

// Use a DIMACS network flow file as stdin.

// max_flow < max_flow.dat

int main()

{

  using namespace boost;

  typedef adjacency_list_traits<vecS, vecS, directedS> Traits;

  typedef adjacency_list<listS, vecS, directedS, 

    property<vertex_name_t, std::string>,

    property<edge_capacity_t, long,

      property<edge_residual_capacity_t, long,

        property<edge_reverse_t, Traits::edge_descriptor> > >

  > Graph;

  Graph g;

  property_map<Graph, edge_capacity_t>::type 

    capacity = get(edge_capacity, g);

  property_map<Graph, edge_reverse_t>::type 

    rev = get(edge_reverse, g);

  property_map<Graph, edge_residual_capacity_t>::type 

    residual_capacity = get(edge_residual_capacity, g);

  Traits::vertex_descriptor s, t;

  read_dimacs_max_flow(g, capacity, rev, s, t);

  std::cout << "edmonds karp demo (BOOST)..." << endl;

  double pre_time=currTime();

  long flow = edmunds_karp_max_flow(g, s, t);

  double post_time=currTime();

  //std::cout << "maximum flow: " << std::endl;

  //graph_traits<Graph>::vertex_iterator u_iter, u_end;

  //graph_traits<Graph>::out_edge_iterator ei, e_end;

  //for (tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter)

  //  for (tie(ei, e_end) = out_edges(*u_iter, g); ei != e_end; ++ei)

  //    if (capacity[*ei] > 0)

  //      std::cout << "f " << *u_iter << " " << target(*ei, g) << " " 

  //                << (capacity[*ei] - residual_capacity[*ei]) << std::endl;

  //

  //std::cout << std::endl;

  std::cout << "elapsed time: " << post_time-pre_time << " sec"<< std::endl; 

  std::cout << "flow value: " << flow << std::endl;

  return 0;

}