//Augmenting on the shortest path

 	//Augmenting on the shortest path

 	Node n=t;

 	Node n=t;

 	ResGraphEdge e;

 	ResGraphEdge e;

 	while (n!=s){

 	while (n!=s){

 	  n = dijkstra.predNode(n);

 	  n = dijkstra.predNode(n);

 	  res_graph.augment(e,1);

 	  res_graph.augment(e,1);

 	  //Let's update the total length

 	  //Let's update the total length

 	  if (res_graph.forward(e))

 	  if (res_graph.forward(e))

 	    total_length += length[e];

 	    total_length += length[e];