reverse_graph

void create_reversed_connection(std::vector<std::list<Vertex>>& result ,int from,int weight,int to)
{
	result[from].push_back({weight,to});
}

//Reverse graph
std::vector<std::list<Vertex> > reverse_graph()
{
	std::vector<std::list<Vertex>> result;
	result.resize(graph.size());

	for(int i=0;i< graph.size();i++)
	{
		for(auto element : graph[i])
		{
			create_reversed_connection(result,element.vertex_number, element.weight, i);
		}
	}

	return result;

}

void print_reversed_graph(std::vector<std::list<Vertex> >& reversed_graph)
{
	for(int i =0;i< reversed_graph.size();i++)
	{
		std::cout << "Vertex " << i << " : ";
		for(auto element:reversed_graph[i])
		{
			std::cout << element.vertex_number << "=>" << element.weight << "  ";
		}

		std::cout << std::endl;
	}
}