public void printSocialGraph(Member m) {
		queue.add(m);
		exists.add(m);
		
		/*
		 * Do a breadth-first search starting from member m.
		 * A breadth-first seach will do a by-level traversal.
		 * We dequeue whoever is on top, print his/her info, then
		 * enqueue that member's friends. If the friend has already
		 * been put into the queue, then don't enqueue them.
		 */
		
		while (queue.size() > 0) {
			Member friend = queue.poll();
			System.out.println("Name: " + friend.name + "    Email: " + friend.email);
			
			for (int i = 0; i < m.friends.size(); i++) {
				Member member = m.friends.get(i);
				if (!exists.contains(member)) {
					queue.add(member);
					exists.add(member);
				}
			}
		}
	}