private CityNode[] getClosest(int numOfCities) {
		CityNode[] nClosest = new CityNode[numOfCities];		//Array to hold the current leaders
		int i, j;		//Indexes declared here to save operations
		
		// Iterate through all the nodes
		for(CityNode n: graph.getGraph()){
			// Make sure this isn't the current city
			if (n == currentCity)
				continue;
			
			// Check if it should be on the leaderboard. If not, stop. If so, pass to the next for.
			for(i = 0 ; i < nClosest.length; i++){
				if((nClosest[i]==null)||(currentCity.closerThan(n, nClosest[i])))
					break;
			}
			if (i >= nClosest.length)
				continue;
			
			// Insert it into the leaderboard by moving the rest of the elements down.
			for(j = (nClosest.length - 1) ; j > i ; j--){
				nClosest[j] = nClosest[j-1];
			}
			nClosest[i] = n;
		}
		return nClosest;
	}