public void findClosestPaths()
	{
		System.out.println("Please input the max distance a city can be away from your current city.\nPlease note that this is only taking into account cities that are directly connected to your current city.");
		input.nextLine();
		int distance=input.nextInt();
		if(distance<100)
			System.out.println("Sorry there are no cities within that distance of your current city");
		else
		{
			if(map.getCurrentCity()==null)
				map.setCurrentCity((int) (Math.random()*(map.getSize()-1)));
			
			ArrayList<Node> cities= new ArrayList<Node>();
			for(int i=0; i<map.getCurrentCity().getAdjacencyList().size(); i++)
			{
				if(map.getCurrentCity().getWeights().get(i)<=distance)
					cities.add(map.getCurrentCity().getAdjacencyList().get(i));
			}
			
			if(cities.size()>0)
			{
				System.out.println("Here are the cities that are directly connected to your current city and less than " + distance + " units by edge weight away from it.");
				for(int i=0; i<cities.size();i++)
				{
					int rank=i+1;
					System.out.println("");
					System.out.println(rank+ ". " + cities.get(i).getCityName());
					System.out.println("");
				}
			}
			
			else
				System.out.println("Sorry there are no cities within that distance of your current city");
		}
	}