public void pulse(int PTime, int PDist,ArrayList<Integer> path) {
		// Add node id to path
		path.add(id);
		// If the path is feasible and updates the primal bound the information on the best solution found is updated
		if(PDist<=PulseGraph.PrimalBound && PTime<=PulseGraph.TimeC){
			
			// Update the best solution known
			PulseGraph.Path.clear();
			PulseGraph.Path.addAll(path);
			PulseGraph.TimeStar=PTime;
			PulseGraph.PrimalBound=PDist;
				
		}
		// Remove the node id to backtrack
		path.remove((path.size()-1));
	}