public Tour tourCalc(Double[] currCity, LinkedList<Double[]> unusedCities, Double[] origin)
	{
		Tour t1 = new Tour();
		//Base case
		if(unusedCities.size() == 0){
			t1.cost = distanceFormula(currCity, origin);
			t1.tour = ((Integer) origin[0].intValue()).toString();
			return t1;
		}
		
		//Set comparison point for all unused cities
		double shortestDistance = distanceFormula(currCity, unusedCities.get(0));
		Double[] closestCity = unusedCities.get(0);
		
		//Compare distances from current city to all cities
		for(Double[] c : unusedCities){
			double currDist = distanceFormula(currCity, c);
			if(currDist < shortestDistance){
				shortestDistance = currDist;
				closestCity = c;
			}
		}
		
		//Remove
		unusedCities.remove(closestCity);
		
		//Initialize Tour
		t1.cost = shortestDistance;
		t1.tour = ((Integer) closestCity[0].intValue()).toString();
		
		//Recursive Call
		return t1.add(tourCalc(closestCity, unusedCities, origin));
	}