@Override
	public synchronized int hashCode() {
		final int prime = 31 + nodos.size();
		long result = 17;
		for (long l : sortNodes())
			result = result * prime +  (int) (l^(l>>>32));

		return (int)result;
	}