private LinkedList<Node> getAllNodes(Node in) {
		LinkedList<Node> list = new LinkedList<Node>();
		list.add(in);
		int i = 0;
		while ( i < list.size() ) {
			for ( Node n : list.get(i).getNeighbors() ) {
				if ( n != null && !list.contains(n) ) list.addLast(n);
			}
			i++;
		}
		
		return list;
	}