private static void userinput () {
		//FindShortPath(w,3,4);
		
		weighted w = readMyFile("paths.txt");

		System.out.println("Locations:");
		
		for (int i = 0;i < w.NodeNames.size() ;i++){
			System.out.print(i+1+" ");
			System.out.println(w.NodeNames.get(i));
		}
		
		System.out.println("Which Location are you traveling from: ");
		Scanner user_input = new Scanner( System.in );
		String command;
		System.out.print(":> ");
		command = user_input.next( );
		
		int LocationA = Integer.parseInt(command);

		System.out.println("Which Location are you traveling To: ");
		System.out.print(":> ");
		command = user_input.next( );
		
		int LocationB = Integer.parseInt(command);
		
		System.out.println("Which Travel Method: 1. Shortest path (ignores distance) 2. Shortest Distance (takes into account distance) ");
		System.out.print(":> ");
		command = user_input.next( );
		
		int method_type = Integer.parseInt(command);
		
		if (method_type == 1){
			FindShortPath(w,LocationA,LocationB);
		}else if (method_type == 2){
			FindShortDistance(w,LocationA,LocationB);
		}
		
		
		
		System.out.println("");
		System.out.println("Again? (y)");
		System.out.print(":> ");
		command = user_input.next( );
		
		if (command.matches("y")){
			userinput();
		}
		
		user_input.close();
		
	}