#include <iostream>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/push_relabel_max_flow.hpp>
#include <boost/graph/graphviz.hpp>
#include <boost/test/floating_point_comparison.hpp>

using namespace std;
using namespace boost;

struct vertexInfo
{

};

struct edgeInfo
{
	double capacity;
	double residualCapacity;
	adjacency_list_traits<vecS, vecS, bidirectionalS>::edge_descriptor rev;
};

typedef adjacency_list<vecS, vecS, bidirectionalS, vertexInfo, edgeInfo> Graph;
typedef Graph::edge_descriptor edge_d;

const char* names[] =
{ "SV", "L1", "L2", "L3", "L4", "ET"};

template<typename Vertex>
void create_edge(Graph& g, Vertex v0, Vertex v1, double capacity)
{
	//the algorithm requires that for each edge u-v in the graph, the edge v-u also exists
	Graph::edge_descriptor ep0 = (add_edge(v0, v1, g)).first;
	Graph::edge_descriptor ep1 = (add_edge(v1, v0, g)).first;
	g[ep0].capacity = capacity;
	g[ep0].rev = ep1;
	g[ep1].capacity = 0; // the capacity of v-u needs to be 0
	g[ep1].rev = ep0;
}

int main()
{
	Graph graph;

	Graph::vertex_descriptor SV = add_vertex(graph);
	Graph::vertex_descriptor L1 = add_vertex(graph);
	Graph::vertex_descriptor L2 = add_vertex(graph);
	Graph::vertex_descriptor L3 = add_vertex(graph);
	Graph::vertex_descriptor L4 = add_vertex(graph);
	Graph::vertex_descriptor ET = add_vertex(graph);



	create_edge(graph, SV, L1, std::numeric_limits<double>::max());
	create_edge(graph, SV, L2, std::numeric_limits<double>::max());
	create_edge(graph, SV, L4, std::numeric_limits<double>::max());

	create_edge(graph, L3, ET, 1000);
	create_edge(graph, ET, L3, 1000);

	create_edge(graph, L4, L3, 1000);
	create_edge(graph, L2, L3, 1000);
	create_edge(graph, L1, L2, 1000);

	// arcos de vuelta
	create_edge(graph, L3, L4, 1000);
	create_edge(graph, L3, L2, 1000);
	create_edge(graph, L2, L1, 1000);

	std::cout << "Max flow: "
			<< push_relabel_max_flow(graph, SV, L3, get(&edgeInfo::capacity, graph), get(&edgeInfo::residualCapacity, graph),
					get(&edgeInfo::rev, graph), get(boost::vertex_index, graph)) << std::endl;



	cout<<"end"<<endl;
	return 0;
}