public void removeUser(int user){

		for (int i = 0; i < names.length; i++){
			System.out.print(getName(i) + ", ");
		}

		for (int i = 0; i < names.length; i++){
			System.out.println("");
			for (int j = 0; j < names.length; j++){
				if (isFriend(i, j) == true){
					System.out.print("1 ");
				}
				else{
					System.out.print("0 ");
				}
			}
		}
		System.out.println("");

		// Create a new array of names with the removed user removed.
		String[] newNames = new String[names.length-1];
		for (int i = 0; i < names.length; i++){
			if (i <= user){
				newNames[i] = names[i];
			}
			else{
				newNames[i-1] = names[i];
			}
		}

		// Repeat the above process with the boolean adjacency matrix.
		boolean[][] newFriendships = new boolean[names.length-1][names.length-1];
		for (int i = 0; i < names.length-1; i++){
			for (int j = 0; i < names.length-1; i++){
				if ((i < user) && (j < user)){
					newFriendships[i][j] = friendships[i][j];
				}
				else if((i >= user) && (j < user)){
					newFriendships[i][j] = friendships[i+1][j];
				}
				else if((i < user) && (j >= user)){
					newFriendships[i][j] = friendships[i][j+1];
				}
				else if ((i >= user) && (j >= user)){
					newFriendships[i][j] = friendships[i+1][j+1];
				}
			}
		}

		this.names = newNames;
		this.friendships = newFriendships;

		for (int i = 0; i < names.length; i++){
			System.out.print(getName(i) + ", ");
		}

		for (int i = 0; i < names.length; i++){
			System.out.println("");
			for (int j = 0; j < names.length; j++){
				if (isFriend(i, j) == true){
					System.out.print("1 ");
				}
				else{
					System.out.print("0 ");
				}
			}
		}
		System.out.println("");
	}