private double calculateTourCost(ArrayList<Integer> tour, double [][] cities, boolean path) {
		double cost = 0;

		if (tour.size() > 1) {
			for (int i = 1; i < tour.size(); i++) {
				cost += euclidianDistance(cities[tour.get(i-1)][0], cities[tour.get(i-1)][1],
										  cities[tour.get(i)][0], cities[tour.get(i)][1]);
			}
			if (!path)
				cost += euclidianDistance(cities[tour.get(tour.size()-1)][0], cities[tour.get(tour.size()-1)][1], cities[tour.get(0)][0], cities[tour.get(0)][1]);
		}
		return cost;
	}