#include <iostream> // for std::cout
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/kolmogorov_max_flow.hpp>

using namespace boost;

typedef adjacency_list_traits<vecS, vecS, bidirectionalS> Traits;

typedef property<edge_reverse_t, Traits::edge_descriptor> EdgeReverseProperty;
typedef property<edge_residual_capacity_t, double, EdgeReverseProperty> EdgeResidualCapacityProperty;
typedef property<edge_capacity_t, double, EdgeResidualCapacityProperty> EdgeCapacityProperty;
typedef property<vertex_color_t, default_color_type,
        property<vertex_distance_t, double,
        property<vertex_predecessor_t, Traits::edge_descriptor> > >
 VertexProperty;

typedef adjacency_list<vecS, vecS, bidirectionalS, VertexProperty, EdgeCapacityProperty> Graph; //simple

int main(int,char*[])
{
 // declare a graph object
 Graph g(2); //a graph with 2 vertices

 //add an edge between node 0 and node 1 with weight (capacity) 2.3
 put(edge_capacity, g, add_edge(0, 1, g).first, 2.3);

 //find min cut

 Traits::vertex_descriptor s, t;
 //double flow = kolmogorov_max_flow(g, s, t); // a list of sources will be returned in s, and a list of sinks will be returned in t
 double flow = kolmogorov_max_flow(g, s, t); // a list of sources will be returned in s, and a list of sinks will be returned in t
 std::cout << "Max flow is: " << flow << std::endl;

 return 0;
}